java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 11:53:32,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 11:53:32,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 11:53:32,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 11:53:32,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 11:53:32,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 11:53:32,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 11:53:32,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 11:53:32,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 11:53:32,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 11:53:32,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 11:53:32,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 11:53:32,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 11:53:32,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 11:53:32,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 11:53:32,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 11:53:32,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 11:53:32,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 11:53:32,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 11:53:32,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 11:53:32,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 11:53:32,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 11:53:32,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 11:53:32,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 11:53:32,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 11:53:32,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 11:53:32,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 11:53:32,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 11:53:32,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 11:53:32,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 11:53:32,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 11:53:32,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-03-23 11:53:32,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 11:53:32,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 11:53:32,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 11:53:32,215 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 11:53:32,215 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 11:53:32,215 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 11:53:32,215 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 11:53:32,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 11:53:32,216 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 11:53:32,216 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 11:53:32,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 11:53:32,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 11:53:32,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 11:53:32,217 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 11:53:32,217 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 11:53:32,217 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 11:53:32,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 11:53:32,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 11:53:32,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 11:53:32,218 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 11:53:32,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 11:53:32,218 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 11:53:32,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 11:53:32,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:32,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 11:53:32,219 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 11:53:32,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 11:53:32,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 11:53:32,220 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 11:53:32,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 11:53:32,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 11:53:32,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 11:53:32,221 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 11:53:32,221 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 11:53:32,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 11:53:32,268 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 11:53:32,272 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 11:53:32,274 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 11:53:32,274 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 11:53:32,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-03-23 11:53:32,606 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG24696e1e1 [2018-03-23 11:53:32,730 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 11:53:32,730 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 11:53:32,731 INFO L171 CDTParser]: Scanning ArraysOfVariableLength5_true-valid-memsafety.c [2018-03-23 11:53:32,732 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 11:53:32,732 INFO L215 ultiparseSymbolTable]: [2018-03-23 11:53:32,732 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 11:53:32,732 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength5_true-valid-memsafety.c [2018-03-23 11:53:32,732 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength5_true-valid-memsafety.c [2018-03-23 11:53:32,732 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 11:53:32,732 INFO L233 ultiparseSymbolTable]: [2018-03-23 11:53:32,747 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG24696e1e1 [2018-03-23 11:53:32,751 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 11:53:32,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 11:53:32,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:32,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 11:53:32,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 11:53:32,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e78345f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32, skipping insertion in model container [2018-03-23 11:53:32,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,777 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:32,789 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:32,922 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:32,946 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:32,950 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-23 11:53:32,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32 WrapperNode [2018-03-23 11:53:32,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:32,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 11:53:32,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 11:53:32,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 11:53:32,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... [2018-03-23 11:53:32,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 11:53:32,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 11:53:32,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 11:53:32,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 11:53:32,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:33,045 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 11:53:33,046 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 11:53:33,046 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-03-23 11:53:33,046 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 11:53:33,046 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo [2018-03-23 11:53:33,046 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 11:53:33,047 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 11:53:33,355 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 11:53:33,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:33 BoogieIcfgContainer [2018-03-23 11:53:33,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 11:53:33,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 11:53:33,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 11:53:33,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 11:53:33,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 11:53:32" (1/3) ... [2018-03-23 11:53:33,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb3b561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:33, skipping insertion in model container [2018-03-23 11:53:33,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:32" (2/3) ... [2018-03-23 11:53:33,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb3b561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:33, skipping insertion in model container [2018-03-23 11:53:33,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:33" (3/3) ... [2018-03-23 11:53:33,361 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-03-23 11:53:33,368 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 11:53:33,373 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-03-23 11:53:33,410 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 11:53:33,411 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 11:53:33,411 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 11:53:33,412 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 11:53:33,412 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 11:53:33,412 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 11:53:33,412 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 11:53:33,412 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 11:53:33,412 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 11:53:33,413 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 11:53:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-03-23 11:53:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-23 11:53:33,437 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:33,438 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:33,438 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1751798805, now seen corresponding path program 1 times [2018-03-23 11:53:33,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:33,444 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:33,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:33,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:33,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:33,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:33,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:53:33,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:53:33,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:53:33,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:33,628 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2018-03-23 11:53:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:33,724 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-03-23 11:53:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:53:33,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-03-23 11:53:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:33,739 INFO L225 Difference]: With dead ends: 138 [2018-03-23 11:53:33,739 INFO L226 Difference]: Without dead ends: 82 [2018-03-23 11:53:33,744 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-03-23 11:53:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-03-23 11:53:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-23 11:53:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-03-23 11:53:33,790 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 16 [2018-03-23 11:53:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:33,790 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-03-23 11:53:33,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:53:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-03-23 11:53:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-23 11:53:33,791 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:33,792 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:33,792 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash -177512800, now seen corresponding path program 1 times [2018-03-23 11:53:33,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:33,792 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:33,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:33,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:33,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:33,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:33,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 11:53:33,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:53:33,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:53:33,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:53:33,928 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2018-03-23 11:53:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:34,071 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-03-23 11:53:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:34,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-03-23 11:53:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:34,073 INFO L225 Difference]: With dead ends: 144 [2018-03-23 11:53:34,073 INFO L226 Difference]: Without dead ends: 92 [2018-03-23 11:53:34,074 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-03-23 11:53:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-03-23 11:53:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-03-23 11:53:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-03-23 11:53:34,085 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 25 [2018-03-23 11:53:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:34,085 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-03-23 11:53:34,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:53:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-03-23 11:53:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-23 11:53:34,087 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:34,087 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:34,087 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1833243520, now seen corresponding path program 1 times [2018-03-23 11:53:34,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:34,088 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:34,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:34,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:34,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:34,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:34,158 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:34,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:34,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:34,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:34,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-03-23 11:53:34,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 11:53:34,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 11:53:34,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:34,288 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 8 states. [2018-03-23 11:53:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:34,415 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-03-23 11:53:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:53:34,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-03-23 11:53:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:34,417 INFO L225 Difference]: With dead ends: 117 [2018-03-23 11:53:34,418 INFO L226 Difference]: Without dead ends: 96 [2018-03-23 11:53:34,418 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-03-23 11:53:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-23 11:53:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-03-23 11:53:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-03-23 11:53:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-03-23 11:53:34,427 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 37 [2018-03-23 11:53:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:34,428 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-03-23 11:53:34,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 11:53:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-03-23 11:53:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-03-23 11:53:34,429 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:34,429 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:34,430 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1055716779, now seen corresponding path program 1 times [2018-03-23 11:53:34,430 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:34,430 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:34,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:34,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:34,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-03-23 11:53:34,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:53:34,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:53:34,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:53:34,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:53:34,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:53:34,479 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 3 states. [2018-03-23 11:53:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:34,512 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-03-23 11:53:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:53:34,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-03-23 11:53:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:34,516 INFO L225 Difference]: With dead ends: 100 [2018-03-23 11:53:34,516 INFO L226 Difference]: Without dead ends: 99 [2018-03-23 11:53:34,517 INFO L568 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 [2018-03-23 11:53:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-03-23 11:53:34,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-03-23 11:53:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-23 11:53:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-03-23 11:53:34,525 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 46 [2018-03-23 11:53:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:34,526 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-03-23 11:53:34,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:53:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-03-23 11:53:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-23 11:53:34,527 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:34,527 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:34,528 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:34,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1632518168, now seen corresponding path program 1 times [2018-03-23 11:53:34,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:34,528 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:34,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:34,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:34,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:53:34,636 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:34,637 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:34,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:34,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:34,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:53:34,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:34,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:34,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-23 11:53:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:53:34,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:34,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-03-23 11:53:34,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-23 11:53:34,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-23 11:53:34,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:53:34,787 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 7 states. [2018-03-23 11:53:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:34,890 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-03-23 11:53:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:53:34,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-03-23 11:53:34,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:34,893 INFO L225 Difference]: With dead ends: 89 [2018-03-23 11:53:34,893 INFO L226 Difference]: Without dead ends: 88 [2018-03-23 11:53:34,893 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:53:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-03-23 11:53:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-03-23 11:53:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-03-23 11:53:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-03-23 11:53:34,904 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 47 [2018-03-23 11:53:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:34,904 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-03-23 11:53:34,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-23 11:53:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-03-23 11:53:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-23 11:53:34,906 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:34,906 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:34,906 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1632518167, now seen corresponding path program 1 times [2018-03-23 11:53:34,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:34,907 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:34,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:34,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:34,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:53:35,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:35,033 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:35,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:35,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:53:35,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:35,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:35,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:53:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:53:35,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:35,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2018-03-23 11:53:35,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 11:53:35,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 11:53:35,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:53:35,154 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 8 states. [2018-03-23 11:53:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:35,284 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-03-23 11:53:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 11:53:35,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-03-23 11:53:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:35,285 INFO L225 Difference]: With dead ends: 97 [2018-03-23 11:53:35,285 INFO L226 Difference]: Without dead ends: 96 [2018-03-23 11:53:35,285 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:53:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-03-23 11:53:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2018-03-23 11:53:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-23 11:53:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-03-23 11:53:35,294 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 47 [2018-03-23 11:53:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:35,295 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-03-23 11:53:35,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 11:53:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-03-23 11:53:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-03-23 11:53:35,296 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:35,296 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:35,296 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 275780314, now seen corresponding path program 1 times [2018-03-23 11:53:35,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:35,297 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:35,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:35,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:35,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:35,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:35,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:35,449 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:35,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:53:35,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:35,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-03-23 11:53:35,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 11:53:35,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 11:53:35,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-03-23 11:53:35,633 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 15 states. [2018-03-23 11:53:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:35,820 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-03-23 11:53:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 11:53:35,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-03-23 11:53:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:35,822 INFO L225 Difference]: With dead ends: 181 [2018-03-23 11:53:35,822 INFO L226 Difference]: Without dead ends: 127 [2018-03-23 11:53:35,822 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-03-23 11:53:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-03-23 11:53:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-03-23 11:53:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-03-23 11:53:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2018-03-23 11:53:35,831 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 55 [2018-03-23 11:53:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:35,831 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2018-03-23 11:53:35,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 11:53:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2018-03-23 11:53:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-23 11:53:35,833 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:35,833 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:35,833 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1105514929, now seen corresponding path program 1 times [2018-03-23 11:53:35,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:35,834 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:35,834 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:35,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:35,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:35,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-03-23 11:53:35,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:35,906 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:35,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:35,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:53:36,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:36,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-03-23 11:53:36,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:53:36,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:53:36,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:53:36,036 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 13 states. [2018-03-23 11:53:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:36,260 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2018-03-23 11:53:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-23 11:53:36,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-03-23 11:53:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:36,262 INFO L225 Difference]: With dead ends: 201 [2018-03-23 11:53:36,262 INFO L226 Difference]: Without dead ends: 141 [2018-03-23 11:53:36,262 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-03-23 11:53:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-03-23 11:53:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2018-03-23 11:53:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-03-23 11:53:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-03-23 11:53:36,271 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 65 [2018-03-23 11:53:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:36,271 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-03-23 11:53:36,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:53:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-03-23 11:53:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-03-23 11:53:36,273 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:36,273 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:36,273 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1979655572, now seen corresponding path program 2 times [2018-03-23 11:53:36,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:36,274 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:36,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:36,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:36,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:36,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-03-23 11:53:36,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:36,348 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:36,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:36,381 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:36,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:36,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-03-23 11:53:36,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:36,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 12] total 14 [2018-03-23 11:53:36,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 11:53:36,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 11:53:36,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-03-23 11:53:36,540 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 15 states. [2018-03-23 11:53:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:37,044 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2018-03-23 11:53:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-23 11:53:37,045 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2018-03-23 11:53:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:37,046 INFO L225 Difference]: With dead ends: 185 [2018-03-23 11:53:37,047 INFO L226 Difference]: Without dead ends: 184 [2018-03-23 11:53:37,047 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-03-23 11:53:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-03-23 11:53:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 151. [2018-03-23 11:53:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-03-23 11:53:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-03-23 11:53:37,060 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 85 [2018-03-23 11:53:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:37,060 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-03-23 11:53:37,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 11:53:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-03-23 11:53:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-03-23 11:53:37,062 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:37,062 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:37,062 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1239780640, now seen corresponding path program 1 times [2018-03-23 11:53:37,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:37,063 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:37,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:37,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:37,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:37,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-03-23 11:53:37,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:37,272 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:37,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:37,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:37,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:53:37,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:37,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:53:37,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:53:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-03-23 11:53:37,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:37,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-03-23 11:53:37,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-23 11:53:37,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-23 11:53:37,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-03-23 11:53:37,438 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 10 states. [2018-03-23 11:53:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:37,715 INFO L93 Difference]: Finished difference Result 176 states and 184 transitions. [2018-03-23 11:53:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-23 11:53:37,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-03-23 11:53:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:37,717 INFO L225 Difference]: With dead ends: 176 [2018-03-23 11:53:37,717 INFO L226 Difference]: Without dead ends: 175 [2018-03-23 11:53:37,717 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 11 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:53:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-03-23 11:53:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 161. [2018-03-23 11:53:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-03-23 11:53:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-03-23 11:53:37,730 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 86 [2018-03-23 11:53:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:37,730 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-03-23 11:53:37,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-23 11:53:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-03-23 11:53:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-03-23 11:53:37,732 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:37,732 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:37,732 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2028181181, now seen corresponding path program 2 times [2018-03-23 11:53:37,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:37,733 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:37,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:37,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:37,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:37,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 49 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-03-23 11:53:38,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:38,178 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:38,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:38,208 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:38,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:38,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 61 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-03-23 11:53:38,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:38,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-03-23 11:53:38,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-03-23 11:53:38,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-03-23 11:53:38,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-03-23 11:53:38,429 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 26 states. [2018-03-23 11:53:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:39,483 INFO L93 Difference]: Finished difference Result 255 states and 269 transitions. [2018-03-23 11:53:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-03-23 11:53:39,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95 [2018-03-23 11:53:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:39,485 INFO L225 Difference]: With dead ends: 255 [2018-03-23 11:53:39,485 INFO L226 Difference]: Without dead ends: 180 [2018-03-23 11:53:39,486 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=429, Invalid=2651, Unknown=0, NotChecked=0, Total=3080 [2018-03-23 11:53:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-03-23 11:53:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2018-03-23 11:53:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-03-23 11:53:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-03-23 11:53:39,493 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 95 [2018-03-23 11:53:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:39,494 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-03-23 11:53:39,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-03-23 11:53:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-03-23 11:53:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-03-23 11:53:39,495 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:39,495 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:39,495 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1032799290, now seen corresponding path program 1 times [2018-03-23 11:53:39,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:39,495 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:39,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:39,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:39,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:39,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-03-23 11:53:39,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:39,582 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:39,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:39,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-03-23 11:53:39,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:39,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2018-03-23 11:53:39,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-23 11:53:39,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-23 11:53:39,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-03-23 11:53:39,714 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 18 states. [2018-03-23 11:53:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:39,992 INFO L93 Difference]: Finished difference Result 232 states and 239 transitions. [2018-03-23 11:53:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-03-23 11:53:39,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 104 [2018-03-23 11:53:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:39,993 INFO L225 Difference]: With dead ends: 232 [2018-03-23 11:53:39,994 INFO L226 Difference]: Without dead ends: 176 [2018-03-23 11:53:39,994 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2018-03-23 11:53:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-03-23 11:53:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 155. [2018-03-23 11:53:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-03-23 11:53:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-03-23 11:53:40,006 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 104 [2018-03-23 11:53:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:40,006 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-03-23 11:53:40,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-23 11:53:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-03-23 11:53:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-03-23 11:53:40,007 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:40,008 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:40,008 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:40,008 INFO L82 PathProgramCache]: Analyzing trace with hash -395053783, now seen corresponding path program 2 times [2018-03-23 11:53:40,008 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:40,008 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:40,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:40,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:40,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:40,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 40 proven. 58 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-03-23 11:53:40,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:40,308 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:40,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:40,323 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-03-23 11:53:40,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:40,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:40,360 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:40,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:53:40,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:40,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:40,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:53:40,408 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:40,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:53:40,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:40,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:40,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:53:40,485 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:53:40,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:53:40,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:53:40,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:53:40,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:53:40,619 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-03-23 11:53:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-03-23 11:53:40,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:53:40,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2018-03-23 11:53:40,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 11:53:40,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 11:53:40,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=328, Unknown=1, NotChecked=36, Total=420 [2018-03-23 11:53:40,663 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 21 states. [2018-03-23 11:53:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:41,160 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2018-03-23 11:53:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-23 11:53:41,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2018-03-23 11:53:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:41,162 INFO L225 Difference]: With dead ends: 169 [2018-03-23 11:53:41,162 INFO L226 Difference]: Without dead ends: 156 [2018-03-23 11:53:41,162 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=1329, Unknown=2, NotChecked=76, Total=1640 [2018-03-23 11:53:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-03-23 11:53:41,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2018-03-23 11:53:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-03-23 11:53:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-03-23 11:53:41,172 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 113 [2018-03-23 11:53:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:41,173 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-03-23 11:53:41,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 11:53:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-03-23 11:53:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-03-23 11:53:41,173 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:41,173 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:41,173 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1399123569, now seen corresponding path program 1 times [2018-03-23 11:53:41,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:41,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:41,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:41,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:53:41,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:41,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-03-23 11:53:41,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:41,260 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:41,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:41,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-23 11:53:41,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:41,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2018-03-23 11:53:41,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:53:41,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:53:41,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:53:41,389 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 13 states. [2018-03-23 11:53:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:41,546 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-03-23 11:53:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-03-23 11:53:41,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-03-23 11:53:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:41,547 INFO L225 Difference]: With dead ends: 185 [2018-03-23 11:53:41,548 INFO L226 Difference]: Without dead ends: 173 [2018-03-23 11:53:41,548 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-03-23 11:53:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-03-23 11:53:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2018-03-23 11:53:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-03-23 11:53:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-03-23 11:53:41,557 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 115 [2018-03-23 11:53:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:41,557 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-03-23 11:53:41,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:53:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-03-23 11:53:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-03-23 11:53:41,558 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:53:41,558 INFO L353 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:53:41,558 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:53:41,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1775952036, now seen corresponding path program 2 times [2018-03-23 11:53:41,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:53:41,558 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:53:41,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:41,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:53:41,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:53:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:53:41,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:53:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-03-23 11:53:41,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:53:41,739 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:53:41,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:53:41,812 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:53:41,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:53:41,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:53:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 170 proven. 13 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-03-23 11:53:42,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:53:42,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16] total 20 [2018-03-23 11:53:42,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-23 11:53:42,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-23 11:53:42,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-03-23 11:53:42,107 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 20 states. [2018-03-23 11:53:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:53:42,492 INFO L93 Difference]: Finished difference Result 240 states and 246 transitions. [2018-03-23 11:53:42,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-23 11:53:42,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 161 [2018-03-23 11:53:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:53:42,493 INFO L225 Difference]: With dead ends: 240 [2018-03-23 11:53:42,493 INFO L226 Difference]: Without dead ends: 0 [2018-03-23 11:53:42,494 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1417, Unknown=0, NotChecked=0, Total=1640 [2018-03-23 11:53:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-03-23 11:53:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-03-23 11:53:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-03-23 11:53:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-03-23 11:53:42,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-03-23 11:53:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:53:42,495 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-03-23 11:53:42,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-23 11:53:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-03-23 11:53:42,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-03-23 11:53:42,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-03-23 11:53:42,544 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 11:53:42,881 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 47 DAG size of output 37 [2018-03-23 11:53:43,116 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 83 DAG size of output 52 [2018-03-23 11:53:43,213 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-03-23 11:53:43,213 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:53:43,213 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:53:43,213 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:53:43,213 INFO L416 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L412 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse11 (select |#valid| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|)) (.cse10 (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.offset|)) (.cse12 (select |#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~b.base|))) (let ((.cse6 (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 0)) (.cse0 (not (= .cse12 32))) (.cse8 (not .cse10)) (.cse9 (not (= .cse11 1)))) (and (let ((.cse5 (<= |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size)) (.cse3 (= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base))) (.cse7 (= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.offset 0)) (.cse4 (select |#length| __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~b.base))) (let ((.cse1 (and .cse10 .cse5 (<= 1 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0) (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size 31) (= 1 .cse11) .cse3 .cse7 (= 32 .cse12) (= .cse4 32))) (.cse2 (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~size |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|))) (or .cse0 (< 31 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) (and (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 1) .cse1 .cse2) (and .cse3 (= 32 .cse4) .cse5 .cse2 .cse6 .cse7) .cse8 .cse9 (and (<= 2 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|) .cse1 .cse2)))) (or .cse0 .cse6 (not (= 0 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|)) .cse8 .cse9) (or .cse0 (<= __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~i~0 2) .cse8 .cse9 (< 2 |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_#in~size|))))) [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L419 ceAbstractionStarter]: At program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooENTRY(lines 12 19) the Hoare annotation is: true [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-03-23 11:53:43,214 INFO L416 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX(line 16) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-03-23 11:53:43,215 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:53:43,215 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point mainErr2EnsuresViolationMEMORY_LEAK(lines 21 35) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point mainErr1AssertViolationARRAY_INDEX(line 30) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:53:43,216 INFO L416 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L412 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse2 (= (select main_~b~0 0) 0)) (.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse3 (= 1 (select |#valid| main_~c~0.base))) (.cse4 (= 0 |main_~#mask~0.offset|)) (.cse5 (= 32 (select |#length| main_~c~0.base))) (.cse6 (= 0 main_~c~0.offset)) (.cse7 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 (<= 1 main_~i~1) .cse2 .cse3 (<= main_~i~1 1) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= main_~i~1 31) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 main_~i~1) .cse7) (and .cse0 .cse1 .cse3 (= 0 main_~i~1) .cse4 .cse5 .cse6 .cse7))) [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-03-23 11:53:43,217 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point L25'''''''(lines 25 28) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point mainErr0AssertViolationARRAY_INDEX(line 27) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point L25'''(lines 25 28) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L416 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:43,218 INFO L412 ceAbstractionStarter]: At program point L25''''''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse2 (= 0 |main_~#mask~0.offset|)) (.cse3 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 (<= 1 main_~i~1) (= (select main_~b~0 0) 0) (= 1 (select |#valid| main_~c~0.base)) .cse2 (= 32 (select |#length| main_~c~0.base)) (= 0 main_~c~0.offset) .cse3) (and .cse0 .cse1 .cse2 (= main_~i~1 0) .cse3))) [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L25'(lines 25 28) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L416 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-03-23 11:53:43,219 INFO L412 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse1 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse2 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse0 (= 1 (select |#valid| main_~c~0.base))) (.cse3 (= 0 |main_~#mask~0.offset|)) (.cse4 (= 32 (select |#length| main_~c~0.base))) (.cse5 (= 0 main_~c~0.offset)) (.cse6 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~i~1) .cse4 .cse5 (= (select main_~b~0 0) 0) .cse6) (and .cse1 .cse2 .cse0 (= 0 main_~i~1) .cse3 .cse4 (= (select main_~b~0 main_~i~1) 0) .cse5 .cse6))) [2018-03-23 11:53:43,220 INFO L416 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-03-23 11:53:43,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 11:53:43 BoogieIcfgContainer [2018-03-23 11:53:43,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 11:53:43,250 INFO L168 Benchmark]: Toolchain (without parser) took 10498.06 ms. Allocated memory was 304.1 MB in the beginning and 613.9 MB in the end (delta: 309.9 MB). Free memory was 249.5 MB in the beginning and 518.4 MB in the end (delta: -269.0 MB). Peak memory consumption was 225.2 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:43,251 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 304.1 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 11:53:43,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.43 ms. Allocated memory is still 304.1 MB. Free memory was 248.5 MB in the beginning and 239.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:43,252 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 304.1 MB. Free memory was 239.3 MB in the beginning and 237.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:43,252 INFO L168 Benchmark]: RCFGBuilder took 365.07 ms. Allocated memory was 304.1 MB in the beginning and 467.7 MB in the end (delta: 163.6 MB). Free memory was 237.2 MB in the beginning and 434.4 MB in the end (delta: -197.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:43,252 INFO L168 Benchmark]: TraceAbstraction took 9892.70 ms. Allocated memory was 467.7 MB in the beginning and 613.9 MB in the end (delta: 146.3 MB). Free memory was 433.1 MB in the beginning and 518.4 MB in the end (delta: -85.4 MB). Peak memory consumption was 245.3 MB. Max. memory is 5.3 GB. [2018-03-23 11:53:43,254 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 304.1 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.43 ms. Allocated memory is still 304.1 MB. Free memory was 248.5 MB in the beginning and 239.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.65 ms. Allocated memory is still 304.1 MB. Free memory was 239.3 MB in the beginning and 237.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 365.07 ms. Allocated memory was 304.1 MB in the beginning and 467.7 MB in the end (delta: 163.6 MB). Free memory was 237.2 MB in the beginning and 434.4 MB in the end (delta: -197.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9892.70 ms. Allocated memory was 467.7 MB in the beginning and 613.9 MB in the end (delta: 146.3 MB). Free memory was 433.1 MB in the beginning and 518.4 MB in the end (delta: -85.4 MB). Peak memory consumption was 245.3 MB. Max. memory is 5.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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-03-23 11:53:43,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 1 <= i) && b[0] == 0) && 1 == \valid[c]) && 0 == mask) && 32 == unknown-#length-unknown[c]) && 0 == c) && \old(\valid)[mask] == 0) || ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && i == 0) && \old(\valid)[mask] == 0) - InvariantResult [Line: 15]: Loop Invariant [2018-03-23 11:53:43,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,268 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,268 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,270 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(unknown-#length-unknown[b] == 32) || 31 < \old(size)) || ((i <= 1 && (((((((0 == b && \old(size) <= size) && 1 <= i) && size <= 31) && 1 == \valid[b]) && 1 == \valid[b]) && b == 0) && 32 == unknown-#length-unknown[b]) && unknown-#length-unknown[b] == 32) && size <= \old(size))) || (((((1 == \valid[b] && 32 == unknown-#length-unknown[b]) && \old(size) <= size) && size <= \old(size)) && i == 0) && b == 0)) || !(0 == b)) || !(\valid[b] == 1)) || ((2 <= \old(size) && (((((((0 == b && \old(size) <= size) && 1 <= i) && size <= 31) && 1 == \valid[b]) && 1 == \valid[b]) && b == 0) && 32 == unknown-#length-unknown[b]) && unknown-#length-unknown[b] == 32) && size <= \old(size))) && ((((!(unknown-#length-unknown[b] == 32) || i == 0) || !(0 == \old(size))) || !(0 == b)) || !(\valid[b] == 1))) && ((((!(unknown-#length-unknown[b] == 32) || i <= 2) || !(0 == b)) || !(\valid[b] == 1)) || 2 < \old(size)) - InvariantResult [Line: 29]: Loop Invariant [2018-03-23 11:53:43,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,272 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:53:43,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && \valid == \old(\valid)[mask := 1]) && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 1 <= i) && 32 == unknown-#length-unknown[c]) && 0 == c) && b[0] == 0) && \old(\valid)[mask] == 0) || ((((((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 1 == \valid[c]) && 0 == i) && 0 == mask) && 32 == unknown-#length-unknown[c]) && b[i] == 0) && 0 == c) && \old(\valid)[mask] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 6 error locations. SAFE Result, 9.8s OverallTime, 15 OverallIterations, 9 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 809 SDtfs, 1682 SDslu, 4285 SDs, 0 SdLazy, 3220 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1263 GetRequests, 936 SyntacticMatches, 26 SemanticMatches, 301 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 214 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 50 NumberOfFragments, 461 HoareAnnotationTreeSize, 29 FomulaSimplifications, 426 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1288 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2107 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2080 ConstructedInterpolants, 108 QuantifiedInterpolants, 630815 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1908 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1571/1816 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_11-53-43-278.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength5_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_11-53-43-278.csv Received shutdown request...