/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:46:21,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:46:21,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:46:21,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:46:21,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:46:21,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:46:21,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:46:21,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:46:21,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:46:21,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:46:21,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:46:21,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:46:21,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:46:21,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:46:21,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:46:21,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:46:21,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:46:21,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:46:21,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:46:21,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:46:21,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:46:21,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:46:21,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:46:21,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:46:21,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:46:21,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:46:21,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:46:21,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:46:21,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:46:21,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:46:21,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:46:21,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:46:21,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:46:21,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:46:21,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:46:21,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:46:21,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:46:21,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:46:21,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:46:21,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:46:21,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:46:21,974 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:46:21,988 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:46:21,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:46:21,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:46:21,990 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:46:21,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:46:21,990 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:46:21,990 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:46:21,990 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:46:21,991 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:46:21,991 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:46:21,991 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:46:21,991 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:46:21,991 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:46:21,991 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:46:21,992 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:46:21,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:46:21,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:46:21,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:46:21,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:46:21,993 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:46:21,993 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:46:21,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:46:21,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:46:21,993 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:46:21,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:46:21,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:46:21,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:46:21,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:46:21,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:46:22,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:46:22,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:46:22,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:46:22,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:46:22,184 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:46:22,185 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:46:22,322 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_VV9O1h/tmp/620cae309a79456ca8cb78a357eafc81/FLAGd7bd53267 [2020-07-01 12:46:22,659 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:46:22,660 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:46:22,660 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:46:22,666 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_VV9O1h/tmp/620cae309a79456ca8cb78a357eafc81/FLAGd7bd53267 [2020-07-01 12:46:23,059 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_VV9O1h/tmp/620cae309a79456ca8cb78a357eafc81 [2020-07-01 12:46:23,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:46:23,071 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:46:23,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:46:23,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:46:23,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:46:23,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@323ba355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23, skipping insertion in model container [2020-07-01 12:46:23,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:46:23,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:46:23,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:46:23,346 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:46:23,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:46:23,377 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:46:23,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23 WrapperNode [2020-07-01 12:46:23,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:46:23,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:46:23,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:46:23,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:46:23,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:46:23,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:46:23,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:46:23,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:46:23,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:46:23,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:46:23,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:46:23,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:46:23,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:46:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:46:23,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:46:23,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:46:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:46:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:46:23,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:46:23,760 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:46:23,760 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:46:23,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23 BoogieIcfgContainer [2020-07-01 12:46:23,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:46:23,765 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:46:23,765 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:46:23,767 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:46:23,768 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23" (1/1) ... [2020-07-01 12:46:23,781 INFO L313 BlockEncoder]: Initial Icfg 36 locations, 38 edges [2020-07-01 12:46:23,783 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:46:23,784 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:46:23,784 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:46:23,784 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:46:23,786 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:46:23,787 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:46:23,787 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:46:23,808 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:46:23,836 INFO L200 BlockEncoder]: SBE split 17 edges [2020-07-01 12:46:23,841 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:46:23,843 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:46:23,878 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:46:23,881 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:46:23,883 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:46:23,883 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:46:23,883 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:46:23,884 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:46:23,884 INFO L313 BlockEncoder]: Encoded RCFG 28 locations, 47 edges [2020-07-01 12:46:23,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:46:23 BasicIcfg [2020-07-01 12:46:23,885 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:46:23,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:46:23,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:46:23,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:46:23,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:46:23" (1/4) ... [2020-07-01 12:46:23,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64769e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:46:23, skipping insertion in model container [2020-07-01 12:46:23,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (2/4) ... [2020-07-01 12:46:23,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64769e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:46:23, skipping insertion in model container [2020-07-01 12:46:23,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23" (3/4) ... [2020-07-01 12:46:23,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64769e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:46:23, skipping insertion in model container [2020-07-01 12:46:23,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:46:23" (4/4) ... [2020-07-01 12:46:23,894 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:46:23,904 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:46:23,912 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-01 12:46:23,926 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-01 12:46:23,950 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:46:23,950 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:46:23,950 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:46:23,951 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:46:23,951 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:46:23,951 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:46:23,951 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:46:23,951 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:46:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-01 12:46:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:46:23,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:23,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:46:23,974 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:46:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash 115897, now seen corresponding path program 1 times [2020-07-01 12:46:23,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:23,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408547687] [2020-07-01 12:46:23,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408547687] [2020-07-01 12:46:24,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285977381] [2020-07-01 12:46:24,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,167 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-07-01 12:46:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,273 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2020-07-01 12:46:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:46:24,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,286 INFO L225 Difference]: With dead ends: 54 [2020-07-01 12:46:24,286 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:46:24,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:46:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:46:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:46:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2020-07-01 12:46:24,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 3 [2020-07-01 12:46:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,327 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 44 transitions. [2020-07-01 12:46:24,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2020-07-01 12:46:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:46:24,328 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:46:24,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:46:24,330 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash 115959, now seen corresponding path program 1 times [2020-07-01 12:46:24,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807560275] [2020-07-01 12:46:24,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807560275] [2020-07-01 12:46:24,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592599129] [2020-07-01 12:46:24,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,383 INFO L87 Difference]: Start difference. First operand 28 states and 44 transitions. Second operand 3 states. [2020-07-01 12:46:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,467 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2020-07-01 12:46:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:46:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,469 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:46:24,469 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:46:24,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:46:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:46:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:46:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2020-07-01 12:46:24,474 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 3 [2020-07-01 12:46:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,475 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-07-01 12:46:24,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2020-07-01 12:46:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:46:24,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:46:24,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:46:24,476 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash 115961, now seen corresponding path program 1 times [2020-07-01 12:46:24,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976043071] [2020-07-01 12:46:24,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976043071] [2020-07-01 12:46:24,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142987471] [2020-07-01 12:46:24,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,519 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. Second operand 3 states. [2020-07-01 12:46:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,574 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2020-07-01 12:46:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:46:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,575 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:46:24,575 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:46:24,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:46:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:46:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:46:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2020-07-01 12:46:24,579 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 3 [2020-07-01 12:46:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,579 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-01 12:46:24,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-01 12:46:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:46:24,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:46:24,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:46:24,580 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 3593078, now seen corresponding path program 1 times [2020-07-01 12:46:24,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342070038] [2020-07-01 12:46:24,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342070038] [2020-07-01 12:46:24,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400758416] [2020-07-01 12:46:24,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,611 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 3 states. [2020-07-01 12:46:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,657 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-01 12:46:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:46:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,658 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:46:24,658 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:46:24,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:46:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:46:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:46:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-01 12:46:24,662 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 4 [2020-07-01 12:46:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,662 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-01 12:46:24,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-01 12:46:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:46:24,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:46:24,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:46:24,663 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash 3593080, now seen corresponding path program 1 times [2020-07-01 12:46:24,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998988177] [2020-07-01 12:46:24,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998988177] [2020-07-01 12:46:24,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597412437] [2020-07-01 12:46:24,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,693 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 3 states. [2020-07-01 12:46:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,722 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-01 12:46:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:46:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,723 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:46:24,723 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:46:24,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:46:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:46:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:46:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-01 12:46:24,727 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 4 [2020-07-01 12:46:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,727 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-01 12:46:24,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-01 12:46:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:46:24,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:46:24,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:46:24,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:46:24,728 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:46:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash 3593081, now seen corresponding path program 1 times [2020-07-01 12:46:24,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176643778] [2020-07-01 12:46:24,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176643778] [2020-07-01 12:46:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784551933] [2020-07-01 12:46:24,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:46:24,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,762 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2020-07-01 12:46:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:24,782 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-01 12:46:24,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:24,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:46:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:46:24,783 INFO L225 Difference]: With dead ends: 16 [2020-07-01 12:46:24,784 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:46:24,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:46:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:46:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:46:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:46:24,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-07-01 12:46:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:46:24,785 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:46:24,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:46:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:46:24,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:46:24,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:46:24,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:46:24,815 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:46:24,815 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 12:46:24,815 INFO L264 CegarLoopResult]: At program point L9-1(lines 8 13) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= 0 ULTIMATE.start_main_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base))) [2020-07-01 12:46:24,815 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-01 12:46:24,815 INFO L268 CegarLoopResult]: For program point L9-2(lines 9 13) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point L7-1(line 7) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:46:24,816 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:46:24,817 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 12:46:24,818 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. [2020-07-01 12:46:24,821 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:46:24,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:24,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:24,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:24,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:24,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:24,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:24,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:46:24 BasicIcfg [2020-07-01 12:46:24,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:46:24,839 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:46:24,840 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:46:24,843 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:46:24,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:24,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:46:23" (1/5) ... [2020-07-01 12:46:24,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df01991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:24,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:46:23" (2/5) ... [2020-07-01 12:46:24,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df01991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:24,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:46:23" (3/5) ... [2020-07-01 12:46:24,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df01991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,845 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:24,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:46:23" (4/5) ... [2020-07-01 12:46:24,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5df01991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:46:24, skipping insertion in model container [2020-07-01 12:46:24,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:46:24,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:46:24" (5/5) ... [2020-07-01 12:46:24,847 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:46:24,868 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:46:24,877 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:46:24,877 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:46:24,877 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:46:24,877 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:46:24,878 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:46:24,878 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:46:24,878 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:46:24,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-07-01 12:46:24,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:46:24,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:46:24,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:46:24,893 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:46:24,893 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:46:24,894 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:46:24,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2020-07-01 12:46:24,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-01 12:46:24,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:46:24,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:46:24,897 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:46:24,897 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:46:24,902 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [86] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [111] L-1-->L7: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_1|, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 6#L7true [55] L7-->L7-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~i~0.base_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 4#L7-1true [52] L7-1-->L9-1: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4) (= 1 (select |v_#valid_8| v_ULTIMATE.start_main_~c~0.base_4)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~c~0.base_4))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 9#L9-1true [2020-07-01 12:46:24,903 INFO L796 eck$LassoCheckResult]: Loop: 9#L9-1true [63] L9-1-->L10: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 15#L10true [69] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~i~0.base_7))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_10|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 27#L10-1true [99] L10-1-->L11: Formula: (>= 10 |v_ULTIMATE.start_main_#t~mem2_6|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_6|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 30#L11true [145] L11-->L11-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_5| (select (select |v_#memory_int_14| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_21| v_ULTIMATE.start_main_~i~0.base_16)) (= |v_ULTIMATE.start_main_#t~post4_5| |v_ULTIMATE.start_main_#t~mem3_5|) (= 1 (select |v_#valid_27| v_ULTIMATE.start_main_~i~0.base_16))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_14|, #length=|v_#length_21|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~mem3] 11#L11-2true [148] L11-2-->L12: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_13 4) (select |v_#length_24| v_ULTIMATE.start_main_~i~0.base_17)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_13) (= (store |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17 (store (select |v_#memory_int_18| v_ULTIMATE.start_main_~i~0.base_17) v_ULTIMATE.start_main_~i~0.offset_13 (+ |v_ULTIMATE.start_main_#t~post4_7| 1))) |v_#memory_int_17|) (= 1 (select |v_#valid_32| v_ULTIMATE.start_main_~i~0.base_17))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_7|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_13, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_17, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_17|, #length=|v_#length_24|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_6|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem3, ULTIMATE.start_main_#t~post4] 19#L12true [149] L12-->L12-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_15 4) (select |v_#length_25| v_ULTIMATE.start_main_~c~0.base_19)) (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_19) v_ULTIMATE.start_main_~c~0.offset_15)) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~c~0.base_19)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_15)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_19, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_15, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_19|, #length=|v_#length_25|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 16#L12-2true [150] L12-2-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_16 4) (select |v_#length_26| v_ULTIMATE.start_main_~c~0.base_20)) (= 1 (select |v_#valid_34| v_ULTIMATE.start_main_~c~0.base_20)) (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~c~0.base_20 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~c~0.base_20) v_ULTIMATE.start_main_~c~0.offset_16 (+ |v_ULTIMATE.start_main_#t~post6_7| 1))) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_16)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_21|, #length=|v_#length_26|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_20, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_16, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post6] 9#L9-1true [2020-07-01 12:46:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 3593975, now seen corresponding path program 1 times [2020-07-01 12:46:24,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768827139] [2020-07-01 12:46:24,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:46:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:46:24,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768827139] [2020-07-01 12:46:24,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:46:24,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:46:24,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293503054] [2020-07-01 12:46:24,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:46:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:46:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash -402693216, now seen corresponding path program 1 times [2020-07-01 12:46:24,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:46:24,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526661796] [2020-07-01 12:46:24,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:46:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:46:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:46:24,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:46:25,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:46:25,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:46:25,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:46:25,056 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2020-07-01 12:46:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:46:25,118 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2020-07-01 12:46:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:46:25,121 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:46:25,126 INFO L168 Benchmark]: Toolchain (without parser) took 2053.73 ms. Allocated memory was 514.9 MB in the beginning and 582.5 MB in the end (delta: 67.6 MB). Free memory was 439.3 MB in the beginning and 515.5 MB in the end (delta: -76.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:46:25,126 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:46:25,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.76 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 438.6 MB in the beginning and 523.5 MB in the end (delta: -85.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:25,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.01 ms. Allocated memory is still 556.3 MB. Free memory was 523.5 MB in the beginning and 522.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:25,128 INFO L168 Benchmark]: Boogie Preprocessor took 23.40 ms. Allocated memory is still 556.3 MB. Free memory was 522.1 MB in the beginning and 520.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:25,129 INFO L168 Benchmark]: RCFGBuilder took 322.90 ms. Allocated memory is still 556.3 MB. Free memory was 520.7 MB in the beginning and 500.6 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:25,129 INFO L168 Benchmark]: BlockEncodingV2 took 120.18 ms. Allocated memory is still 556.3 MB. Free memory was 499.9 MB in the beginning and 491.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:25,130 INFO L168 Benchmark]: TraceAbstraction took 952.66 ms. Allocated memory is still 556.3 MB. Free memory was 490.5 MB in the beginning and 398.0 MB in the end (delta: 92.5 MB). Peak memory consumption was 92.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:46:25,130 INFO L168 Benchmark]: BuchiAutomizer took 284.00 ms. Allocated memory was 556.3 MB in the beginning and 582.5 MB in the end (delta: 26.2 MB). Free memory was 398.0 MB in the beginning and 515.5 MB in the end (delta: -117.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:46:25,134 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 36 locations, 38 edges - StatisticsResult: Encoded RCFG 28 locations, 47 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.76 ms. Allocated memory was 514.9 MB in the beginning and 556.3 MB in the end (delta: 41.4 MB). Free memory was 438.6 MB in the beginning and 523.5 MB in the end (delta: -85.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.01 ms. Allocated memory is still 556.3 MB. Free memory was 523.5 MB in the beginning and 522.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.40 ms. Allocated memory is still 556.3 MB. Free memory was 522.1 MB in the beginning and 520.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 322.90 ms. Allocated memory is still 556.3 MB. Free memory was 520.7 MB in the beginning and 500.6 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 120.18 ms. Allocated memory is still 556.3 MB. Free memory was 499.9 MB in the beginning and 491.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 952.66 ms. Allocated memory is still 556.3 MB. Free memory was 490.5 MB in the beginning and 398.0 MB in the end (delta: 92.5 MB). Peak memory consumption was 92.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 284.00 ms. Allocated memory was 556.3 MB in the beginning and 582.5 MB in the end (delta: 26.2 MB). Free memory was 398.0 MB in the beginning and 515.5 MB in the end (delta: -117.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 7]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 12:46:25,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:25,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:25,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:46:25,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:25,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:46:25,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((1 == \valid[i] && 4 == unknown-#length-unknown[i]) && 0 == i) && 4 == unknown-#length-unknown[c]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 1 == \valid[c] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.8s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 142 SDslu, 3 SDs, 0 SdLazy, 129 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:46:19.729 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp/BenchExec_run_VV9O1h/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:46:25.370 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check