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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:17:10,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:17:10,516 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:17:10,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:17:10,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:17:10,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:17:10,531 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:17:10,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:17:10,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:17:10,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:17:10,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:17:10,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:17:10,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:17:10,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:17:10,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:17:10,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:17:10,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:17:10,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:17:10,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:17:10,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:17:10,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:17:10,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:17:10,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:17:10,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:17:10,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:17:10,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:17:10,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:17:10,553 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:17:10,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:17:10,554 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:17:10,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:17:10,555 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.epf [2018-01-24 12:17:10,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:17:10,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:17:10,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:17:10,566 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:17:10,566 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:17:10,567 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:17:10,567 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:17:10,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:17:10,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:17:10,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:17:10,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:17:10,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:17:10,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:17:10,569 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:17:10,569 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:17:10,569 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:17:10,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:17:10,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:17:10,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:17:10,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:17:10,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:17:10,570 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:17:10,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:17:10,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:17:10,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:17:10,571 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:17:10,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:17:10,571 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:17:10,572 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:17:10,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:17:10,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:17:10,572 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:17:10,573 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:17:10,573 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:17:10,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:17:10,619 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:17:10,622 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:17:10,623 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:17:10,624 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:17:10,624 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-01-24 12:17:10,759 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:17:10,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:17:10,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:10,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:17:10,773 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:17:10,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ad43a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10, skipping insertion in model container [2018-01-24 12:17:10,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,795 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:10,815 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:17:10,930 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:10,945 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:17:10,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10 WrapperNode [2018-01-24 12:17:10,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:17:10,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:17:10,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:17:10,953 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:17:10,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (1/1) ... [2018-01-24 12:17:10,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:17:10,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:17:10,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:17:10,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:17:10,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (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-01-24 12:17:11,036 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:17:11,036 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:17:11,036 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:17:11,036 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:17:11,036 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:17:11,036 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:17:11,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:17:11,234 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:17:11,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:11 BoogieIcfgContainer [2018-01-24 12:17:11,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:17:11,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:17:11,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:17:11,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:17:11,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:17:10" (1/3) ... [2018-01-24 12:17:11,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f33063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:11, skipping insertion in model container [2018-01-24 12:17:11,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:17:10" (2/3) ... [2018-01-24 12:17:11,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f33063e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:17:11, skipping insertion in model container [2018-01-24 12:17:11,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:17:11" (3/3) ... [2018-01-24 12:17:11,243 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-01-24 12:17:11,249 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:17:11,254 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 12:17:11,296 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:17:11,296 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:17:11,296 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:17:11,297 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:17:11,297 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:17:11,297 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:17:11,297 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:17:11,297 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:17:11,298 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:17:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 12:17:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:17:11,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:11,323 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:11,323 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 12:17:11,330 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:11,330 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:11,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:11,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:11,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:11,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:11,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:11,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:17:11,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:17:11,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:17:11,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:17:11,494 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 12:17:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:11,562 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 12:17:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:17:11,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 12:17:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:11,571 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:17:11,571 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:17:11,574 INFO L525 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-01-24 12:17:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:17:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 12:17:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:17:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 12:17:11,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 12:17:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:11,668 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 12:17:11,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:17:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 12:17:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:17:11,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:11,669 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:11,669 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 12:17:11,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:11,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:11,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:11,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:11,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:11,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:11,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:17:11,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:17:11,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:17:11,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:17:11,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:17:11,765 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 12:17:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:11,921 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-24 12:17:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:11,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 12:17:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:11,922 INFO L225 Difference]: With dead ends: 103 [2018-01-24 12:17:11,922 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:17:11,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:17:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-01-24 12:17:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:17:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 12:17:11,932 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 16 [2018-01-24 12:17:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:11,932 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 12:17:11,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:17:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 12:17:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:17:11,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:11,934 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:11,934 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1974903447, now seen corresponding path program 1 times [2018-01-24 12:17:11,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:11,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:11,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:11,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:11,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:11,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:11,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:11,992 INFO L209 onRefinementStrategy]: 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-01-24 12:17:12,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:12,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:12,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:12,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-24 12:17:12,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:17:12,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:17:12,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:12,078 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-01-24 12:17:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:12,143 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-01-24 12:17:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:17:12,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:17:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:12,145 INFO L225 Difference]: With dead ends: 88 [2018-01-24 12:17:12,145 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 12:17:12,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:17:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 12:17:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-24 12:17:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 12:17:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-24 12:17:12,155 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 23 [2018-01-24 12:17:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:12,155 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-24 12:17:12,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:17:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-24 12:17:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:17:12,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:12,157 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:12,157 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 621927392, now seen corresponding path program 1 times [2018-01-24 12:17:12,157 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:12,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:12,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:12,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:12,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:12,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:12,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:12,238 INFO L209 onRefinementStrategy]: 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-01-24 12:17:12,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:12,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 12:17:12,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:12,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-01-24 12:17:12,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:17:12,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:17:12,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:17:12,303 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-01-24 12:17:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:12,488 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-01-24 12:17:12,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:17:12,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 12:17:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:12,491 INFO L225 Difference]: With dead ends: 115 [2018-01-24 12:17:12,491 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 12:17:12,492 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:17:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 12:17:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2018-01-24 12:17:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:17:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 12:17:12,502 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 28 [2018-01-24 12:17:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:12,502 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 12:17:12,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:17:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 12:17:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:17:12,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:12,504 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:12,504 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880015, now seen corresponding path program 1 times [2018-01-24 12:17:12,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:12,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:12,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:12,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:12,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:12,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:12,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:12,692 INFO L209 onRefinementStrategy]: 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-01-24 12:17:12,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:12,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:12,741 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-01-24 12:17:12,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:12,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:12,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:17:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:12,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:12,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-01-24 12:17:12,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:12,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:12,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:12,835 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 12 states. [2018-01-24 12:17:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:13,187 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-24 12:17:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:17:13,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 12:17:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:13,188 INFO L225 Difference]: With dead ends: 111 [2018-01-24 12:17:13,188 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 12:17:13,189 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:17:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 12:17:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 66. [2018-01-24 12:17:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 12:17:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-24 12:17:13,200 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 29 [2018-01-24 12:17:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:13,201 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-24 12:17:13,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-24 12:17:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:17:13,202 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:13,202 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:13,203 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:13,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2099880014, now seen corresponding path program 1 times [2018-01-24 12:17:13,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:13,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:13,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:13,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:13,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:13,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:13,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:13,270 INFO L209 onRefinementStrategy]: 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-01-24 12:17:13,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:13,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:13,321 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-01-24 12:17:13,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:13,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:13,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:17:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:17:13,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:13,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-01-24 12:17:13,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:17:13,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:17:13,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:17:13,421 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 7 states. [2018-01-24 12:17:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:13,473 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-01-24 12:17:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:17:13,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 12:17:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:13,475 INFO L225 Difference]: With dead ends: 66 [2018-01-24 12:17:13,475 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:17:13,475 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:17:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-24 12:17:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:17:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-24 12:17:13,484 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 29 [2018-01-24 12:17:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:13,484 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-24 12:17:13,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:17:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-24 12:17:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:17:13,485 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:13,485 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-24 12:17:13,486 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash -533212584, now seen corresponding path program 1 times [2018-01-24 12:17:13,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:13,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:13,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:13,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:13,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:13,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:13,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:13,590 INFO L209 onRefinementStrategy]: 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-01-24 12:17:13,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:13,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:17:13,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:13,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2018-01-24 12:17:13,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:17:13,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:17:13,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:17:13,709 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 15 states. [2018-01-24 12:17:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:13,868 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-24 12:17:13,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:17:13,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 12:17:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:13,871 INFO L225 Difference]: With dead ends: 140 [2018-01-24 12:17:13,871 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 12:17:13,872 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:17:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 12:17:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2018-01-24 12:17:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:17:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-24 12:17:13,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 34 [2018-01-24 12:17:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:13,885 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-24 12:17:13,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:17:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-24 12:17:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:17:13,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:13,887 INFO L322 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] [2018-01-24 12:17:13,888 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2137316393, now seen corresponding path program 1 times [2018-01-24 12:17:13,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:13,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:13,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:13,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:13,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:13,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:17:13,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:13,953 INFO L209 onRefinementStrategy]: 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-01-24 12:17:13,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:13,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 12:17:14,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:14,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-01-24 12:17:14,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:17:14,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:17:14,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:17:14,031 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 9 states. [2018-01-24 12:17:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:14,154 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2018-01-24 12:17:14,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:17:14,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-24 12:17:14,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:14,155 INFO L225 Difference]: With dead ends: 161 [2018-01-24 12:17:14,156 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:17:14,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:17:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:17:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2018-01-24 12:17:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 12:17:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 12:17:14,168 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 43 [2018-01-24 12:17:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:14,168 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 12:17:14,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:17:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 12:17:14,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:17:14,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:14,170 INFO L322 BasicCegarLoop]: trace histogram [5, 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] [2018-01-24 12:17:14,170 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1798255855, now seen corresponding path program 2 times [2018-01-24 12:17:14,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:14,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:14,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:14,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:14,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:14,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 12:17:14,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:14,315 INFO L209 onRefinementStrategy]: 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-01-24 12:17:14,323 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:14,336 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:14,348 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:14,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:14,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:17:14,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:14,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-01-24 12:17:14,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:17:14,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:17:14,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:17:14,501 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 16 states. [2018-01-24 12:17:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:14,935 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-24 12:17:14,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:17:14,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-01-24 12:17:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:14,937 INFO L225 Difference]: With dead ends: 162 [2018-01-24 12:17:14,937 INFO L226 Difference]: Without dead ends: 135 [2018-01-24 12:17:14,938 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-01-24 12:17:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-24 12:17:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2018-01-24 12:17:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 12:17:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 12:17:14,951 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 52 [2018-01-24 12:17:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:14,951 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 12:17:14,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:17:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 12:17:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 12:17:14,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:14,952 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:14,952 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash -88643296, now seen corresponding path program 1 times [2018-01-24 12:17:14,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:14,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:14,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:14,954 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:17:14,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:14,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 12:17:15,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:15,204 INFO L209 onRefinementStrategy]: 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-01-24 12:17:15,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:15,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:15,244 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-01-24 12:17:15,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:15,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:17:15,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:17:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 12:17:15,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:15,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-01-24 12:17:15,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:17:15,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:17:15,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:17:15,435 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 14 states. [2018-01-24 12:17:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:15,683 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-01-24 12:17:15,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:17:15,683 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-01-24 12:17:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:15,684 INFO L225 Difference]: With dead ends: 141 [2018-01-24 12:17:15,684 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 12:17:15,685 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:17:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 12:17:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 102. [2018-01-24 12:17:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 12:17:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 12:17:15,697 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 53 [2018-01-24 12:17:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:15,697 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 12:17:15,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:17:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 12:17:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-24 12:17:15,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:15,699 INFO L322 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:15,700 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798415, now seen corresponding path program 1 times [2018-01-24 12:17:15,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:15,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:15,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:15,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:15,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:15,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-24 12:17:15,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:15,818 INFO L209 onRefinementStrategy]: 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-01-24 12:17:15,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:15,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:15,952 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 12:17:15,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:17:15,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-01-24 12:17:15,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:17:15,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:17:15,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:17:15,974 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 13 states. [2018-01-24 12:17:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:16,191 INFO L93 Difference]: Finished difference Result 224 states and 242 transitions. [2018-01-24 12:17:16,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:17:16,191 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2018-01-24 12:17:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:16,192 INFO L225 Difference]: With dead ends: 224 [2018-01-24 12:17:16,192 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 12:17:16,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:17:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 12:17:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2018-01-24 12:17:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 12:17:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-01-24 12:17:16,207 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 85 [2018-01-24 12:17:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:16,207 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-01-24 12:17:16,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:17:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-01-24 12:17:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-24 12:17:16,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:17:16,211 INFO L322 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:17:16,211 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 12:17:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash 304425042, now seen corresponding path program 2 times [2018-01-24 12:17:16,212 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:17:16,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:17:16,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:16,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:17:16,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:17:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:17:16,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:17:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-01-24 12:17:16,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:17:16,337 INFO L209 onRefinementStrategy]: 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-01-24 12:17:16,344 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:17:16,358 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:17:16,359 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:17:16,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:17:16,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,386 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-01-24 12:17:16,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,388 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-01-24 12:17:16,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:16,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,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-01-24 12:17:16,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,409 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-01-24 12:17:16,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:16,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,452 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-01-24 12:17:16,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,453 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-01-24 12:17:16,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:16,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,488 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-01-24 12:17:16,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,489 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-01-24 12:17:16,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:16,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:17:16,518 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-01-24 12:17:16,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:17:16,520 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-01-24 12:17:16,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:17:16,546 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 12:17:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2018-01-24 12:17:16,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:17:16,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-01-24 12:17:16,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:17:16,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:17:16,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2018-01-24 12:17:16,591 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand 12 states. [2018-01-24 12:17:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:17:16,894 INFO L93 Difference]: Finished difference Result 208 states and 229 transitions. [2018-01-24 12:17:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:17:16,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 121 [2018-01-24 12:17:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:17:16,895 INFO L225 Difference]: With dead ends: 208 [2018-01-24 12:17:16,895 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:17:16,896 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 110 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=439, Unknown=1, NotChecked=46, Total=650 [2018-01-24 12:17:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:17:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:17:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:17:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:17:16,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2018-01-24 12:17:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:17:16,897 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:17:16,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:17:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:17:16,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:17:16,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:17:17,413 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 60 DAG size of output 32 [2018-01-24 12:17:18,075 WARN L146 SmtUtils]: Spent 498ms on a formula simplification. DAG size of input: 92 DAG size of output 55 [2018-01-24 12:17:18,121 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point L15''''(lines 15 17) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L397 ceAbstractionStarter]: At program point L15'''(lines 15 17) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse3 (not (= 32 (select |#length| |foo_#in~b.base|))))) (let ((.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse4 (<= |foo_#in~size| foo_~size)) (.cse9 (or .cse0 .cse3)) (.cse2 (= foo_~i~1 0))) (and (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) (and (= foo_~size 0) .cse2) .cse3) (let ((.cse5 (= 1 (select |#valid| foo_~b.base))) (.cse6 (= (select |#length| foo_~b.base) 32)) (.cse7 (<= foo_~size 31)) (.cse8 (= foo_~b.offset 0))) (or (< 31 |foo_#in~size|) (and .cse4 .cse5 .cse6 (= 0 foo_~i~1) .cse7 .cse8) .cse1 (and .cse5 .cse6 .cse7 .cse8 (<= 1 foo_~i~1)) .cse9)) (or .cse1 (<= foo_~size 2) (< 2 |foo_#in~size|) .cse9) (let ((.cse10 (<= foo_~size 1))) (or .cse1 (and .cse10 .cse4 (= 1 foo_~i~1)) (< 1 |foo_#in~size|) .cse9 (and .cse10 .cse2)))))) [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-24 12:17:18,122 INFO L401 ceAbstractionStarter]: For program point L15(lines 15 17) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 35) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point L15''(lines 15 17) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 35) the Hoare annotation is: true [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 35) no Hoare annotation was computed. [2018-01-24 12:17:18,123 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 35) the Hoare annotation is: true [2018-01-24 12:17:18,123 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 35) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 35) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 28) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (= 1 (select |#valid| main_~c~3.base)) .cse0 .cse1 .cse2 .cse3 (<= 1 main_~i~3) (= main_~c~3.offset 0) (= 32 (select |#length| main_~c~3.base))) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 12:17:18,124 INFO L401 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse3 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse4 (select |#length| main_~c~3.base)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse5 (= 0 |main_~#mask~3.offset|)) (.cse6 (= 0 main_~c~3.offset))) (or (and .cse0 .cse1 .cse2 (and (<= 1 main_~i~3) .cse3 (= .cse4 32) .cse5) .cse6 (<= main_~i~3 31)) (and .cse0 .cse3 .cse1 (= 32 .cse4) (= main_~i~3 0) .cse2 .cse5 .cse6))) [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| main_~c~3.base))) (.cse1 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse2 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse5 (= 32 (select |#length| main_~c~3.base))) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (= 0 |main_~#mask~3.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 main_~i~3) (= main_~c~3.offset 0) .cse5) (and .cse0 .cse1 .cse2 .cse5 (= main_~i~3 0) .cse3 .cse4 (= 0 main_~c~3.offset)))) [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 28) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 21 35) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 28) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-01-24 12:17:18,125 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:17:18,125 INFO L401 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-24 12:17:18,126 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 12:17:18,126 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 12:17:18,126 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 12:17:18,126 INFO L401 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-24 12:17:18,126 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 12:17:18,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,143 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,144 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,147 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,148 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,148 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,148 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,148 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,149 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,150 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,151 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,152 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,153 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:17:18 BoogieIcfgContainer [2018-01-24 12:17:18,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:17:18,156 INFO L168 Benchmark]: Toolchain (without parser) took 7396.67 ms. Allocated memory was 305.1 MB in the beginning and 572.5 MB in the end (delta: 267.4 MB). Free memory was 266.2 MB in the beginning and 497.8 MB in the end (delta: -231.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:18,157 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:17:18,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.67 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 256.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:18,158 INFO L168 Benchmark]: Boogie Preprocessor took 27.47 ms. Allocated memory is still 305.1 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:18,158 INFO L168 Benchmark]: RCFGBuilder took 255.34 ms. Allocated memory is still 305.1 MB. Free memory was 254.2 MB in the beginning and 239.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:18,159 INFO L168 Benchmark]: TraceAbstraction took 6918.82 ms. Allocated memory was 305.1 MB in the beginning and 572.5 MB in the end (delta: 267.4 MB). Free memory was 239.6 MB in the beginning and 497.8 MB in the end (delta: -258.2 MB). Peak memory consumption was 162.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:17:18,160 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.13 ms. Allocated memory is still 305.1 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 185.67 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 256.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.47 ms. Allocated memory is still 305.1 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 255.34 ms. Allocated memory is still 305.1 MB. Free memory was 254.2 MB in the beginning and 239.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6918.82 ms. Allocated memory was 305.1 MB in the beginning and 572.5 MB in the end (delta: 267.4 MB). Free memory was 239.6 MB in the beginning and 497.8 MB in the end (delta: -258.2 MB). Peak memory consumption was 162.6 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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 - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 12:17:18,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 1 <= i) && c == 0) && 32 == unknown-#length-unknown[c]) || (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 32 == unknown-#length-unknown[c]) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) && 0 == c) - InvariantResult [Line: 15]: Loop Invariant [2018-01-24 12:17:18,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || (size == 0 && i == 0)) || !(32 == unknown-#length-unknown[b])) && ((((31 < \old(size) || (((((\old(size) <= size && 1 == \valid[b]) && unknown-#length-unknown[b] == 32) && 0 == i) && size <= 31) && b == 0)) || !(\valid[b] == 1)) || ((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size <= 31) && b == 0) && 1 <= i)) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && (((!(\valid[b] == 1) || size <= 2) || 2 < \old(size)) || !(0 == b) || !(32 == unknown-#length-unknown[b]))) && ((((!(\valid[b] == 1) || ((size <= 1 && \old(size) <= size) && 1 == i)) || 1 < \old(size)) || !(0 == b) || !(32 == unknown-#length-unknown[b])) || (size <= 1 && i == 0)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 12:17:18,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:17:18,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 == \valid[c] && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) && 1 <= i) && c == 0) && 32 == unknown-#length-unknown[c]) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. SAFE Result, 6.8s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 419 SDtfs, 1404 SDslu, 1613 SDs, 0 SdLazy, 1622 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 458 SyntacticMatches, 20 SemanticMatches, 154 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=11, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 267 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 31 PreInvPairs, 65 NumberOfFragments, 377 HoareAnnotationTreeSize, 31 FomulaSimplifications, 2532 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2746 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1021 NumberOfCodeBlocks, 919 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 999 ConstructedInterpolants, 104 QuantifiedInterpolants, 251763 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1176 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 999/1188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-17-18-182.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-17-18-182.csv Received shutdown request...