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_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:51:45,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:51:45,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:51:45,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:51:45,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:51:45,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:51:45,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:51:45,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:51:45,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:51:45,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:51:45,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:51:45,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:51:45,731 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:51:45,732 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:51:45,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:51:45,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:51:45,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:51:45,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:51:45,741 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:51:45,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:51:45,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:51:45,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:51:45,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:51:45,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:51:45,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:51:45,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:51:45,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:51:45,750 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:51:45,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:51:45,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:51:45,751 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:51:45,752 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:51:45,760 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:51:45,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:51:45,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:51:45,762 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:51:45,762 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:51:45,762 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:51:45,762 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:51:45,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:51:45,763 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:51:45,763 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:51:45,763 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:51:45,763 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:51:45,763 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:51:45,763 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:51:45,764 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:51:45,764 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:51:45,765 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:51:45,765 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:51:45,765 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:51:45,765 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:51:45,765 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:51:45,766 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:51:45,766 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:51:45,766 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:51:45,766 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:51:45,766 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:51:45,766 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:51:45,767 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:51:45,767 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:51:45,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:51:45,811 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:51:45,814 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:51:45,816 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:51:45,816 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:51:45,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-24 15:51:45,921 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:51:45,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:51:45,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:45,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:51:45,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:51:45,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:45" (1/1) ... [2018-01-24 15:51:45,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af8409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:45, skipping insertion in model container [2018-01-24 15:51:45,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:51:45" (1/1) ... [2018-01-24 15:51:45,954 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:45,973 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:51:46,095 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:46,110 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:51:46,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46 WrapperNode [2018-01-24 15:51:46,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:51:46,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:51:46,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:51:46,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:51:46,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (1/1) ... [2018-01-24 15:51:46,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:51:46,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:51:46,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:51:46,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:51:46,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (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 15:51:46,203 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:51:46,203 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:51:46,203 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:51:46,203 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:51:46,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:51:46,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:51:46,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:51:46,402 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:51:46,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:46 BoogieIcfgContainer [2018-01-24 15:51:46,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:51:46,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:51:46,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:51:46,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:51:46,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:51:45" (1/3) ... [2018-01-24 15:51:46,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b5b5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:46, skipping insertion in model container [2018-01-24 15:51:46,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:51:46" (2/3) ... [2018-01-24 15:51:46,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b5b5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:51:46, skipping insertion in model container [2018-01-24 15:51:46,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:51:46" (3/3) ... [2018-01-24 15:51:46,410 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-24 15:51:46,416 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:51:46,422 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 15:51:46,458 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:51:46,458 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:51:46,458 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:51:46,458 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:51:46,458 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:51:46,458 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:51:46,458 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:51:46,458 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:51:46,459 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:51:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 15:51:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 15:51:46,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:46,490 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:46,490 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 15:51:46,499 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:46,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:46,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:46,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:46,543 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:46,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:46,707 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 15:51:46,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:46,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:51:46,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:46,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:51:46,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:51:46,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:51:46,725 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 15:51:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:46,819 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 15:51:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:51:46,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 15:51:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:46,829 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:51:46,829 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:51:46,832 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 15:51:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:51:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 15:51:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:51:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 15:51:46,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 15:51:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:46,933 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 15:51:46,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:51:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 15:51:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:51:46,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:46,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:46,934 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 15:51:46,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:46,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:46,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:46,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:46,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:46,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:47,055 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 15:51:47,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:47,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:51:47,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:47,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:47,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:47,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:51:47,059 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 15:51:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:47,313 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-24 15:51:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:47,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 15:51:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:47,317 INFO L225 Difference]: With dead ends: 129 [2018-01-24 15:51:47,317 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 15:51:47,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:51:47,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 15:51:47,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-01-24 15:51:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 15:51:47,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-01-24 15:51:47,330 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-01-24 15:51:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:47,330 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-01-24 15:51:47,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-01-24 15:51:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:51:47,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:47,331 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:47,331 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 15:51:47,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:47,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:47,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:47,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:47,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:47,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:47,442 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 15:51:47,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:47,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:47,442 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:47,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:47,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:47,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:47,444 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2018-01-24 15:51:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:47,562 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-24 15:51:47,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:47,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:51:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:47,563 INFO L225 Difference]: With dead ends: 77 [2018-01-24 15:51:47,563 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 15:51:47,563 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 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 15:51:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 15:51:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-01-24 15:51:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 15:51:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-01-24 15:51:47,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 17 [2018-01-24 15:51:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:47,571 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-01-24 15:51:47,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-01-24 15:51:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:51:47,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:47,572 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:47,572 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 15:51:47,572 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:47,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:47,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:47,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:47,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:47,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:47,615 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 15:51:47,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:51:47,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:51:47,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:47,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:47,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:47,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:51:47,617 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2018-01-24 15:51:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:47,655 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 15:51:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:47,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:51:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:47,657 INFO L225 Difference]: With dead ends: 68 [2018-01-24 15:51:47,657 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 15:51:47,657 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 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 15:51:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 15:51:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 15:51:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 15:51:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-24 15:51:47,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 17 [2018-01-24 15:51:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:47,668 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-24 15:51:47,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-24 15:51:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:51:47,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:47,670 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] [2018-01-24 15:51:47,670 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 15:51:47,670 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:47,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:47,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:47,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:47,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:47,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:51:47,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:47,810 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:47,811 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-24 15:51:47,813 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [14], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-24 15:51:47,859 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:47,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:48,126 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:48,127 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 15:51:48,138 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:48,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:48,138 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:51:48,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:48,158 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:48,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:48,262 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 15:51:48,263 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:48,337 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 15:51:48,358 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:48,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [8] total 14 [2018-01-24 15:51:48,358 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:48,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:48,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:48,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:51:48,359 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2018-01-24 15:51:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:48,484 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-24 15:51:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:48,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 15:51:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:48,485 INFO L225 Difference]: With dead ends: 124 [2018-01-24 15:51:48,485 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:51:48,486 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:51:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:51:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2018-01-24 15:51:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 15:51:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 15:51:48,493 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 22 [2018-01-24 15:51:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:48,494 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 15:51:48,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 15:51:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:51:48,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:48,495 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:48,495 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-01-24 15:51:48,496 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:48,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:48,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:48,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:48,497 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:48,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:48,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:48,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:48,536 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:51:48,536 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [40], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:48,537 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:48,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:49,275 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:49,276 INFO L268 AbstractInterpreter]: Visited 26 different actions 96 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:51:49,281 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:49,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:49,281 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:51:49,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:49,299 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:49,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:49,404 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:49,552 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:49,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2018-01-24 15:51:49,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:49,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:49,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:49,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:49,553 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2018-01-24 15:51:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:49,698 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 15:51:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:51:49,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 15:51:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:49,700 INFO L225 Difference]: With dead ends: 76 [2018-01-24 15:51:49,700 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:51:49,701 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:51:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:51:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2018-01-24 15:51:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 15:51:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-24 15:51:49,709 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 29 [2018-01-24 15:51:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:49,709 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-24 15:51:49,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-24 15:51:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 15:51:49,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:49,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:49,711 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-01-24 15:51:49,712 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:49,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:49,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:49,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:49,713 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:49,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:49,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:49,757 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:49,757 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 15:51:49,757 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [37], [39], [41], [43], [45], [49], [53], [58], [60], [63], [65], [66], [67], [78], [79], [80], [81], [83], [84] [2018-01-24 15:51:49,759 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:49,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:50,501 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:50,502 INFO L268 AbstractInterpreter]: Visited 35 different actions 119 times. Merged at 24 different actions 57 times. Never widened. Found 8 fixpoints after 4 different actions. Largest state had 21 variables. [2018-01-24 15:51:50,503 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:50,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:50,504 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:51:50,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:50,515 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:50,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:50,548 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:50,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:50,605 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:50,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:50,613 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:50,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:50,656 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:51:50,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:50,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-24 15:51:50,674 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:50,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:51:50,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:51:50,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:51:50,675 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2018-01-24 15:51:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:50,772 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-01-24 15:51:50,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:51:50,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-24 15:51:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:50,773 INFO L225 Difference]: With dead ends: 104 [2018-01-24 15:51:50,773 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 15:51:50,774 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:51:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 15:51:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2018-01-24 15:51:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 15:51:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-24 15:51:50,783 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 37 [2018-01-24 15:51:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:50,784 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-24 15:51:50,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:51:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-24 15:51:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 15:51:50,785 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:50,785 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:50,785 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:50,785 INFO L82 PathProgramCache]: Analyzing trace with hash 465858064, now seen corresponding path program 1 times [2018-01-24 15:51:50,786 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:50,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:50,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:50,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:50,787 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:50,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 15:51:50,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:50,943 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:50,943 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-24 15:51:50,943 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:50,944 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:50,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:51,463 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:51,463 INFO L268 AbstractInterpreter]: Visited 26 different actions 99 times. Merged at 16 different actions 46 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:51:51,473 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:51,473 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:51,474 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:51:51,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:51,483 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:51,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 15:51:51,537 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 15:51:51,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:51,639 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:51,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:51,666 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:51,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 15:51:51,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 15:51:51,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:51,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 3, 3, 3] total 12 [2018-01-24 15:51:51,760 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:51,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 15:51:51,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 15:51:51,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:51:51,761 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 11 states. [2018-01-24 15:51:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:52,024 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-24 15:51:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:51:52,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-01-24 15:51:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:52,026 INFO L225 Difference]: With dead ends: 91 [2018-01-24 15:51:52,026 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 15:51:52,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:51:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 15:51:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 70. [2018-01-24 15:51:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 15:51:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-24 15:51:52,036 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2018-01-24 15:51:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:52,036 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-24 15:51:52,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 15:51:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-24 15:51:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:51:52,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:52,038 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:52,038 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:52,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1556698143, now seen corresponding path program 1 times [2018-01-24 15:51:52,038 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:52,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:52,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:52,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:52,039 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:52,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 15:51:52,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:52,370 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:52,370 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 15:51:52,371 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:51:52,372 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:51:52,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:51:52,765 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:51:52,765 INFO L268 AbstractInterpreter]: Visited 26 different actions 99 times. Merged at 16 different actions 46 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:51:52,776 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:51:52,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:52,776 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:51:52,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:52,791 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:52,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:52,848 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 15:51:52,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:52,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:52,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:51:53,121 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:51:53,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:53,269 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:51:53,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:53,276 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:51:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:53,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:53,323 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 15:51:53,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:53,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:51:53,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:51:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:51:53,371 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 15:51:53,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:51:53,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 16 [2018-01-24 15:51:53,393 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:51:53,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:51:53,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:51:53,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:51:53,394 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 13 states. [2018-01-24 15:51:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:53,820 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-01-24 15:51:53,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:51:53,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-01-24 15:51:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:53,822 INFO L225 Difference]: With dead ends: 89 [2018-01-24 15:51:53,822 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 15:51:53,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-01-24 15:51:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 15:51:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2018-01-24 15:51:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 15:51:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 15:51:53,830 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 41 [2018-01-24 15:51:53,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:53,831 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 15:51:53,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:51:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 15:51:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-24 15:51:53,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:51:53,833 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:51:53,833 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:51:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1898563809, now seen corresponding path program 2 times [2018-01-24 15:51:53,833 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:51:53,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:53,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:51:53,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:51:53,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:51:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:51:53,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:51:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:51:53,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:53,894 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:51:53,894 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:51:53,894 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:51:53,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:51:53,895 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 15:51:53,903 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:51:53,903 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:51:53,914 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:51:53,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:51:53,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:51:53,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:53,943 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 15:51:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:53,945 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 15:51:53,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:53,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:51:53,999 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 15:51:53,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:51:54,001 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 15:51:54,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:51:54,051 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 15:51:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:54,058 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:51:54,074 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_15| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_~#mask~3.base_15|) 0)))) is different from false [2018-01-24 15:51:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-24 15:51:54,101 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:51:54,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-01-24 15:51:54,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:51:54,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:51:54,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:51:54,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2018-01-24 15:51:54,103 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-01-24 15:51:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:51:54,189 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 15:51:54,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:51:54,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-24 15:51:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:51:54,190 INFO L225 Difference]: With dead ends: 66 [2018-01-24 15:51:54,190 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:51:54,191 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2018-01-24 15:51:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:51:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:51:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:51:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:51:54,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-24 15:51:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:51:54,192 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:51:54,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:51:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:51:54,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:51:54,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:51:54,569 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 65 DAG size of output 46 [2018-01-24 15:51:54,736 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-24 15:51:54,736 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:51:54,736 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-24 15:51:54,736 INFO L401 ceAbstractionStarter]: For program point L17''''(lines 17 19) no Hoare annotation was computed. [2018-01-24 15:51:54,736 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 14 21) no Hoare annotation was computed. [2018-01-24 15:51:54,736 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 14 21) no Hoare annotation was computed. [2018-01-24 15:51:54,736 INFO L397 ceAbstractionStarter]: At program point L17'''(lines 17 19) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (= foo_~i~1 0)) (.cse3 (not (= 32 (select |#length| |foo_#in~b.base|))))) (and (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) (and (<= foo_~size 0) (= 1 foo_~i~1)) (and (= foo_~size 0) .cse2) .cse3) (or (< 31 |foo_#in~size|) .cse0 .cse1 (let ((.cse4 (= 1 (select |#valid| foo_~b.base))) (.cse5 (select |#length| foo_~b.base)) (.cse6 (<= foo_~size 31)) (.cse7 (= foo_~b.offset 0))) (or (and .cse4 (= 32 .cse5) .cse6 .cse7 .cse2) (and (and .cse4 (<= 1 foo_~i~1)) (= .cse5 32) .cse6 .cse7))) .cse3))) [2018-01-24 15:51:54,736 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 14 21) the Hoare annotation is: true [2018-01-24 15:51:54,736 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L17''(lines 17 19) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 18) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 23 35) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-24 15:51:54,737 INFO L401 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L397 ceAbstractionStarter]: At program point L27'(line 27) 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 main_~i~3) .cse0 .cse1 .cse2 .cse3 (<= main_~i~3 31)) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L25'(line 25) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L397 ceAbstractionStarter]: At program point L29'''(lines 29 33) 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 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L26''''(lines 26 28) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L25''(line 25) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-24 15:51:54,738 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2018-01-24 15:51:54,739 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 23 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:51:54,739 INFO L401 ceAbstractionStarter]: For program point L29''''(lines 29 33) no Hoare annotation was computed. [2018-01-24 15:51:54,739 INFO L401 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-24 15:51:54,739 INFO L401 ceAbstractionStarter]: For program point L26''(lines 26 28) no Hoare annotation was computed. [2018-01-24 15:51:54,739 INFO L401 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-24 15:51:54,739 INFO L397 ceAbstractionStarter]: At program point L26'''(lines 26 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 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-24 15:51:54,739 INFO L401 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-24 15:51:54,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,745 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,746 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,755 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,756 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,757 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,757 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:51:54 BoogieIcfgContainer [2018-01-24 15:51:54,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:51:54,760 INFO L168 Benchmark]: Toolchain (without parser) took 8837.95 ms. Allocated memory was 305.7 MB in the beginning and 661.1 MB in the end (delta: 355.5 MB). Free memory was 266.7 MB in the beginning and 586.3 MB in the end (delta: -319.6 MB). Peak memory consumption was 274.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:54,761 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:51:54,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.23 ms. Allocated memory is still 305.7 MB. Free memory was 265.7 MB in the beginning and 257.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:54,761 INFO L168 Benchmark]: Boogie Preprocessor took 34.20 ms. Allocated memory is still 305.7 MB. Free memory was 257.7 MB in the beginning and 255.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:54,762 INFO L168 Benchmark]: RCFGBuilder took 252.49 ms. Allocated memory is still 305.7 MB. Free memory was 255.6 MB in the beginning and 240.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:54,762 INFO L168 Benchmark]: TraceAbstraction took 8355.63 ms. Allocated memory was 305.7 MB in the beginning and 661.1 MB in the end (delta: 355.5 MB). Free memory was 239.9 MB in the beginning and 586.3 MB in the end (delta: -346.4 MB). Peak memory consumption was 247.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:51:54,764 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.14 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 189.23 ms. Allocated memory is still 305.7 MB. Free memory was 265.7 MB in the beginning and 257.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.20 ms. Allocated memory is still 305.7 MB. Free memory was 257.7 MB in the beginning and 255.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 252.49 ms. Allocated memory is still 305.7 MB. Free memory was 255.6 MB in the beginning and 240.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8355.63 ms. Allocated memory was 305.7 MB in the beginning and 661.1 MB in the end (delta: 355.5 MB). Free memory was 239.9 MB in the beginning and 586.3 MB in the end (delta: -346.4 MB). Peak memory consumption was 247.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 147 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 31 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.559055 RENAME_VARIABLES(MILLISECONDS) : 0.466623 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.494215 PROJECTAWAY(MILLISECONDS) : 0.273533 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.168696 DISJOIN(MILLISECONDS) : 2.421423 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.522328 ADD_EQUALITY(MILLISECONDS) : 0.050132 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.036841 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 59 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 31 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 201 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.788497 RENAME_VARIABLES(MILLISECONDS) : 0.252371 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.750179 PROJECTAWAY(MILLISECONDS) : 0.172384 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.125036 DISJOIN(MILLISECONDS) : 0.220189 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.276818 ADD_EQUALITY(MILLISECONDS) : 0.039013 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032093 #CONJOIN_DISJUNCTIVE : 129 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 212 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 293 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 257 LocStat_NO_SUPPORTING_DISEQUALITIES : 63 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.847909 RENAME_VARIABLES(MILLISECONDS) : 0.328193 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.807458 PROJECTAWAY(MILLISECONDS) : 0.223295 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054511 DISJOIN(MILLISECONDS) : 0.325162 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.370040 ADD_EQUALITY(MILLISECONDS) : 0.016693 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010717 #CONJOIN_DISJUNCTIVE : 164 #RENAME_VARIABLES : 363 #UNFREEZE : 0 #CONJOIN : 242 #PROJECTAWAY : 241 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 363 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 214 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.774539 RENAME_VARIABLES(MILLISECONDS) : 0.244588 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.740858 PROJECTAWAY(MILLISECONDS) : 0.189309 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.096178 DISJOIN(MILLISECONDS) : 0.316071 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.275362 ADD_EQUALITY(MILLISECONDS) : 0.037039 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016926 #CONJOIN_DISJUNCTIVE : 120 #RENAME_VARIABLES : 265 #UNFREEZE : 0 #CONJOIN : 186 #PROJECTAWAY : 188 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 27 #RENAME_VARIABLES_DISJUNCTIVE : 259 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 209 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.458976 RENAME_VARIABLES(MILLISECONDS) : 0.145111 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.438461 PROJECTAWAY(MILLISECONDS) : 0.103913 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.058076 DISJOIN(MILLISECONDS) : 0.144955 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.163251 ADD_EQUALITY(MILLISECONDS) : 0.015315 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006308 #CONJOIN_DISJUNCTIVE : 130 #RENAME_VARIABLES : 301 #UNFREEZE : 0 #CONJOIN : 214 #PROJECTAWAY : 207 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 295 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * 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 * 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: 18]: 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: 23]: 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: 17]: Loop Invariant [2018-01-24 15:51:54,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,775 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,777 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,778 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || (size <= 0 && 1 == i)) || (size == 0 && i == 0)) || !(32 == unknown-#length-unknown[b])) && ((((31 < \old(size) || !(0 == b)) || !(\valid[b] == 1)) || ((((1 == \valid[b] && 32 == unknown-#length-unknown[b]) && size <= 31) && b == 0) && i == 0) || ((((1 == \valid[b] && 1 <= i) && unknown-#length-unknown[b] == 32) && size <= 31) && b == 0)) || !(32 == unknown-#length-unknown[b])) - InvariantResult [Line: 29]: Loop Invariant [2018-01-24 15:51:54,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 26]: Loop Invariant [2018-01-24 15:51:54,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:51:54,783 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((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, 8.2s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 358 SDtfs, 532 SDslu, 830 SDs, 0 SdLazy, 633 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 733 GetRequests, 638 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 124 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 252 HoareAnnotationTreeSize, 17 FomulaSimplifications, 301 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 506 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 615 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 923 ConstructedInterpolants, 46 QuantifiedInterpolants, 133687 SizeOfPredicates, 12 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 286/344 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/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_15-51-54-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-51-54-788.csv Received shutdown request...