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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:59:01,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:59:01,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:59:01,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:59:01,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:59:01,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:59:01,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:59:01,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:59:01,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:59:01,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:59:01,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:59:01,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:59:01,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:59:01,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:59:01,176 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:59:01,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:59:01,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:59:01,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:59:01,183 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:59:01,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:59:01,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:59:01,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:59:01,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:59:01,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:59:01,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:59:01,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:59:01,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:59:01,191 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:59:01,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:59:01,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:59:01,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:59:01,192 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_smtcomp.epf [2018-01-25 05:59:01,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:59:01,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:59:01,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:59:01,202 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:59:01,203 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:59:01,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:59:01,203 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:59:01,203 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:59:01,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:59:01,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:59:01,204 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:59:01,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:59:01,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:59:01,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:59:01,205 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:59:01,205 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:59:01,205 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:59:01,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:59:01,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:59:01,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:59:01,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:59:01,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:59:01,206 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:59:01,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:59:01,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:59:01,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:59:01,207 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:59:01,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:59:01,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:59:01,208 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:59:01,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:59:01,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:59:01,208 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:59:01,209 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:59:01,209 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:59:01,210 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:59:01,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:59:01,254 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:59:01,257 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:59:01,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:59:01,259 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:59:01,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-25 05:59:01,455 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:59:01,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:59:01,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:59:01,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:59:01,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:59:01,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f765ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01, skipping insertion in model container [2018-01-25 05:59:01,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,482 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:59:01,497 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:59:01,601 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:59:01,616 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:59:01,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01 WrapperNode [2018-01-25 05:59:01,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:59:01,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:59:01,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:59:01,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:59:01,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (1/1) ... [2018-01-25 05:59:01,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:59:01,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:59:01,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:59:01,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:59:01,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (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-25 05:59:01,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:59:01,706 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:59:01,706 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 05:59:01,706 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:59:01,707 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:59:01,707 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:59:01,707 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:59:01,707 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:59:01,707 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:59:01,708 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 05:59:01,708 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:59:01,708 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:59:01,708 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:59:01,912 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:59:01,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:59:01 BoogieIcfgContainer [2018-01-25 05:59:01,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:59:01,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:59:01,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:59:01,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:59:01,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:59:01" (1/3) ... [2018-01-25 05:59:01,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2a41ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:59:01, skipping insertion in model container [2018-01-25 05:59:01,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:59:01" (2/3) ... [2018-01-25 05:59:01,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2a41ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:59:01, skipping insertion in model container [2018-01-25 05:59:01,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:59:01" (3/3) ... [2018-01-25 05:59:01,918 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-25 05:59:01,925 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:59:01,931 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-25 05:59:01,977 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:59:01,977 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:59:01,978 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:59:01,978 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:59:01,978 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:59:01,978 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:59:01,978 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:59:01,978 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:59:01,979 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:59:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 05:59:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:59:02,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:02,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:02,001 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-25 05:59:02,010 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:02,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:02,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:02,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:02,181 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-25 05:59:02,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:59:02,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:59:02,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:02,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:59:02,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:59:02,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:59:02,205 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 05:59:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:02,302 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-25 05:59:02,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:59:02,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 05:59:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:02,311 INFO L225 Difference]: With dead ends: 101 [2018-01-25 05:59:02,311 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:59:02,314 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-25 05:59:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:59:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-25 05:59:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:59:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 05:59:02,409 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-25 05:59:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:02,409 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 05:59:02,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:59:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 05:59:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 05:59:02,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:02,410 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:02,410 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:02,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-25 05:59:02,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:02,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:02,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,412 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:02,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:02,517 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-25 05:59:02,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:59:02,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:59:02,517 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:02,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:59:02,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:59:02,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:59:02,520 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-25 05:59:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:02,729 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-25 05:59:02,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:59:02,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-25 05:59:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:02,733 INFO L225 Difference]: With dead ends: 129 [2018-01-25 05:59:02,733 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 05:59:02,735 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-25 05:59:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 05:59:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-01-25 05:59:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 05:59:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-01-25 05:59:02,747 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-01-25 05:59:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:02,747 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-01-25 05:59:02,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:59:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-01-25 05:59:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:59:02,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:02,748 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:02,748 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-25 05:59:02,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:02,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:02,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,751 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:02,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:02,879 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-25 05:59:02,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:59:02,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:59:02,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:02,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:59:02,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:59:02,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:59:02,881 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2018-01-25 05:59:02,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:02,978 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-25 05:59:02,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:59:02,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 05:59:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:02,980 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:59:02,980 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 05:59:02,981 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-25 05:59:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 05:59:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-01-25 05:59:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 05:59:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-01-25 05:59:02,993 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 17 [2018-01-25 05:59:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:02,993 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-01-25 05:59:02,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:59:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-01-25 05:59:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:59:02,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:02,994 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:02,994 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-25 05:59:02,995 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:02,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:02,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:02,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:03,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:03,043 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-25 05:59:03,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:59:03,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:59:03,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:03,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:59:03,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:59:03,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:59:03,044 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2018-01-25 05:59:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:03,093 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-25 05:59:03,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:59:03,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 05:59:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:03,094 INFO L225 Difference]: With dead ends: 68 [2018-01-25 05:59:03,094 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 05:59:03,095 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-25 05:59:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 05:59:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 05:59:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 05:59:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-25 05:59:03,105 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 17 [2018-01-25 05:59:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:03,106 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-25 05:59:03,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:59:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-25 05:59:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:59:03,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:03,107 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-25 05:59:03,107 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-25 05:59:03,107 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:03,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:03,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:03,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:03,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:03,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:03,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:03,222 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:03,223 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 05:59:03,224 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-25 05:59:03,271 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:59:03,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:59:03,543 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:59:03,545 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-25 05:59:03,567 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:59:03,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:03,568 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-25 05:59:03,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:03,583 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:03,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:03,639 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:03,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:03,692 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:03,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:03,703 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:03,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:03,729 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:03,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:03,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3, 3, 3] total 10 [2018-01-25 05:59:03,741 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:03,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:59:03,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:59:03,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:59:03,742 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-01-25 05:59:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:03,923 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2018-01-25 05:59:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:59:03,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 05:59:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:03,927 INFO L225 Difference]: With dead ends: 107 [2018-01-25 05:59:03,927 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 05:59:03,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:59:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 05:59:03,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2018-01-25 05:59:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-25 05:59:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-01-25 05:59:03,937 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 22 [2018-01-25 05:59:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:03,937 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-01-25 05:59:03,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:59:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-01-25 05:59:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:59:03,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:03,938 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-25 05:59:03,938 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:03,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-01-25 05:59:03,938 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:03,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:03,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:03,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:03,939 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:03,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:04,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:04,069 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:04,070 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:59:04,070 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-25 05:59:04,071 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:59:04,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:59:05,062 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:59:05,062 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-25 05:59:05,077 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:59:05,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:05,082 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-25 05:59:05,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:05,090 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:05,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:05,170 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:05,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:05,317 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-25 05:59:05,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:05,325 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:05,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:05,462 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-25 05:59:05,463 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:05,529 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-25 05:59:05,537 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-25 05:59:05,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6, 6, 6] total 16 [2018-01-25 05:59:05,537 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:05,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:59:05,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:59:05,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:59:05,538 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 5 states. [2018-01-25 05:59:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:05,609 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-01-25 05:59:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:59:05,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 05:59:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:05,611 INFO L225 Difference]: With dead ends: 101 [2018-01-25 05:59:05,611 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 05:59:05,612 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:59:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 05:59:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-01-25 05:59:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 05:59:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-25 05:59:05,622 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 29 [2018-01-25 05:59:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:05,622 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-25 05:59:05,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:59:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-25 05:59:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:59:05,624 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:05,624 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:05,624 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2013598170, now seen corresponding path program 1 times [2018-01-25 05:59:05,624 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:05,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:05,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:05,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:05,626 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:05,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 05:59:05,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:59:05,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 05:59:05,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:05,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:59:05,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:59:05,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:59:05,814 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 9 states. [2018-01-25 05:59:06,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:06,021 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2018-01-25 05:59:06,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:59:06,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-25 05:59:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:06,022 INFO L225 Difference]: With dead ends: 147 [2018-01-25 05:59:06,022 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 05:59:06,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:59:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 05:59:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-01-25 05:59:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 05:59:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-01-25 05:59:06,032 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 35 [2018-01-25 05:59:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:06,033 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-01-25 05:59:06,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:59:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-01-25 05:59:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:59:06,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:06,035 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-25 05:59:06,035 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:06,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-01-25 05:59:06,035 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:06,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:06,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:06,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:06,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:06,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:06,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:06,159 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:06,159 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 05:59:06,160 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-25 05:59:06,161 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:59:06,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:59:07,153 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:59:07,153 INFO L268 AbstractInterpreter]: Visited 35 different actions 123 times. Merged at 25 different actions 62 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-25 05:59:07,162 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:59:07,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:07,162 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-25 05:59:07,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:07,175 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:07,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:07,267 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:59:07,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:07,448 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-25 05:59:07,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:07,452 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:07,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:07,494 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-25 05:59:07,494 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:07,518 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-25 05:59:07,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:07,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 4, 4] total 16 [2018-01-25 05:59:07,519 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:07,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:59:07,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:59:07,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:59:07,520 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 10 states. [2018-01-25 05:59:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:07,656 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2018-01-25 05:59:07,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:59:07,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-25 05:59:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:07,657 INFO L225 Difference]: With dead ends: 147 [2018-01-25 05:59:07,657 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 05:59:07,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:59:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 05:59:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-01-25 05:59:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 05:59:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-25 05:59:07,666 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2018-01-25 05:59:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:07,667 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-25 05:59:07,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:59:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-25 05:59:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:59:07,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:07,668 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:07,668 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash 833411622, now seen corresponding path program 2 times [2018-01-25 05:59:07,669 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:07,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:07,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:07,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:07,670 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:07,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:59:07,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:07,712 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:07,712 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:07,713 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:07,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:07,713 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-25 05:59:07,725 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:07,725 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:07,734 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:07,746 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:07,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:07,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:59:07,786 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-25 05:59:07,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:07,789 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-25 05:59:07,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-25 05:59:07,841 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-25 05:59:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:59:07,852 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:07,875 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-25 05:59:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:59:07,916 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:59:07,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [4] total 10 [2018-01-25 05:59:07,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:59:07,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:59:07,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:59:07,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2018-01-25 05:59:07,918 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-01-25 05:59:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:08,037 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-25 05:59:08,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:59:08,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-25 05:59:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:08,039 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:59:08,039 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 05:59:08,039 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2018-01-25 05:59:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 05:59:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-25 05:59:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 05:59:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-01-25 05:59:08,046 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 43 [2018-01-25 05:59:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:08,047 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-01-25 05:59:08,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:59:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-01-25 05:59:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-25 05:59:08,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:08,054 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:08,054 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-01-25 05:59:08,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:08,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:08,056 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:08,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:08,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:08,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:59:08,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:08,193 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:08,194 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-01-25 05:59:08,194 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-25 05:59:08,195 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:59:08,195 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:59:08,600 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:59:08,600 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-25 05:59:08,606 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:59:08,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:08,606 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:08,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:08,622 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:08,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:59:08,857 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:59:08,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:08,999 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 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 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:09,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:09,003 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:09,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:59:09,054 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 05:59:09,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:09,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9, 9] total 22 [2018-01-25 05:59:09,129 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:09,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:59:09,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:59:09,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:59:09,130 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2018-01-25 05:59:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:09,354 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-01-25 05:59:09,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:59:09,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-01-25 05:59:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:09,356 INFO L225 Difference]: With dead ends: 131 [2018-01-25 05:59:09,356 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 05:59:09,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 218 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:59:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 05:59:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-01-25 05:59:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:59:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-25 05:59:09,369 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 59 [2018-01-25 05:59:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:09,369 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-25 05:59:09,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:59:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-25 05:59:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-25 05:59:09,371 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:09,371 INFO L322 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:09,371 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash 315437000, now seen corresponding path program 2 times [2018-01-25 05:59:09,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:09,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:09,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:09,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:09,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:09,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 125 proven. 68 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 05:59:09,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:09,589 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:09,589 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:09,589 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:09,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:09,589 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:09,594 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:09,595 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:09,603 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:09,612 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:09,614 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:09,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 05:59:09,698 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 05:59:09,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:09,883 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 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 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:09,888 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:09,888 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:09,901 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:09,923 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:09,937 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:09,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 05:59:09,953 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 05:59:10,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:10,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8, 8, 8] total 23 [2018-01-25 05:59:10,011 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:10,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:59:10,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:59:10,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:59:10,012 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 20 states. [2018-01-25 05:59:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:10,322 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-01-25 05:59:10,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:59:10,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-01-25 05:59:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:10,324 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:59:10,324 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 05:59:10,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 315 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 05:59:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 05:59:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-25 05:59:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 05:59:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-01-25 05:59:10,335 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 83 [2018-01-25 05:59:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:10,335 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-01-25 05:59:10,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:59:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-01-25 05:59:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-25 05:59:10,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:10,337 INFO L322 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:10,337 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1642738256, now seen corresponding path program 3 times [2018-01-25 05:59:10,337 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:10,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:10,339 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:10,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:10,339 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:10,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 138 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-25 05:59:10,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:10,706 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:10,707 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:10,707 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:10,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:10,707 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:10,712 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:59:10,712 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:59:10,721 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:10,725 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:10,730 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:10,731 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:10,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:10,738 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-25 05:59:10,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:10,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:10,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 138 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-25 05:59:10,956 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-25 05:59:11,134 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:11,134 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 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 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:11,137 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:59:11,137 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:59:11,149 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:11,159 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:11,178 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:11,189 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:11,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:11,196 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-25 05:59:11,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:11,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:11,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 148 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-25 05:59:11,332 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 130 proven. 38 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-25 05:59:11,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:11,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 12, 11] total 38 [2018-01-25 05:59:11,508 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:11,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 05:59:11,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 05:59:11,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:59:11,509 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 21 states. [2018-01-25 05:59:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:11,686 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-01-25 05:59:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:59:11,686 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-01-25 05:59:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:11,688 INFO L225 Difference]: With dead ends: 128 [2018-01-25 05:59:11,688 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 05:59:11,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 320 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 05:59:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 05:59:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-01-25 05:59:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 05:59:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-01-25 05:59:11,699 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 89 [2018-01-25 05:59:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:11,700 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-01-25 05:59:11,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 05:59:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-01-25 05:59:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-25 05:59:11,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:11,701 INFO L322 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:11,701 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash -630750615, now seen corresponding path program 4 times [2018-01-25 05:59:11,702 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:11,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:11,702 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:11,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:11,703 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:11,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:11,981 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 325 proven. 125 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-25 05:59:11,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:11,981 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:11,981 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:11,981 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:11,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:11,981 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:11,987 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:59:11,987 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:59:12,016 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:12,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 05:59:12,097 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 05:59:12,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:12,259 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 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 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:12,262 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:59:12,263 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:59:12,308 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:12,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 05:59:12,325 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 05:59:12,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:12,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10, 10, 10] total 25 [2018-01-25 05:59:12,403 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:12,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 05:59:12,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 05:59:12,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:59:12,404 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 21 states. [2018-01-25 05:59:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:12,881 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2018-01-25 05:59:12,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:59:12,881 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-01-25 05:59:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:12,882 INFO L225 Difference]: With dead ends: 181 [2018-01-25 05:59:12,882 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 05:59:12,883 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 459 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1131, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 05:59:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 05:59:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2018-01-25 05:59:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 05:59:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-01-25 05:59:12,905 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 119 [2018-01-25 05:59:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:12,906 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-01-25 05:59:12,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 05:59:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-01-25 05:59:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-25 05:59:12,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:12,908 INFO L322 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:12,908 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:12,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1849014223, now seen corresponding path program 5 times [2018-01-25 05:59:12,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:12,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:12,910 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:12,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:12,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:12,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:13,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:13,333 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:13,334 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:13,334 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:13,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:13,334 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:13,339 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:59:13,339 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:13,349 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,352 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,357 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,362 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,366 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,373 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,376 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:13,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:13,390 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-25 05:59:13,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:13,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:13,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:13,515 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:13,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:13,633 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 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 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:13,636 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:59:13,636 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:13,648 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,656 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,673 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,700 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,741 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,879 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:13,899 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:13,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:13,907 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-25 05:59:13,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:13,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:13,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:14,006 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:14,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:14,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-25 05:59:14,040 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:14,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:59:14,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:59:14,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:59:14,041 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 13 states. [2018-01-25 05:59:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:14,151 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-01-25 05:59:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:59:14,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2018-01-25 05:59:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:14,153 INFO L225 Difference]: With dead ends: 142 [2018-01-25 05:59:14,153 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 05:59:14,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 474 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:59:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 05:59:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-01-25 05:59:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 05:59:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-01-25 05:59:14,164 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 125 [2018-01-25 05:59:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:14,164 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-01-25 05:59:14,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:59:14,164 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-01-25 05:59:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-25 05:59:14,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:14,166 INFO L322 BasicCegarLoop]: trace histogram [17, 14, 14, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:14,166 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash 659173177, now seen corresponding path program 6 times [2018-01-25 05:59:14,167 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:14,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:14,167 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:14,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:14,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:14,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:14,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:14,454 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:14,454 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:14,454 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:14,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:14,454 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:14,460 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:59:14,460 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:59:14,472 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:14,482 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:14,493 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:14,503 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:14,513 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:14,531 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:14,533 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:14,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:14,540 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-25 05:59:14,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:14,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:14,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 349 proven. 174 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-25 05:59:14,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 319 proven. 204 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-25 05:59:15,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:15,175 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 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 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:15,178 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:59:15,178 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:59:15,190 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:15,199 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:15,216 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:15,244 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:15,285 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:15,371 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:15,391 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:15,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:15,399 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-25 05:59:15,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:15,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:15,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:15,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 05:59:15,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:15,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15, 9, 8] total 48 [2018-01-25 05:59:15,740 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:15,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-25 05:59:15,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-25 05:59:15,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2083, Unknown=0, NotChecked=0, Total=2352 [2018-01-25 05:59:15,741 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 25 states. [2018-01-25 05:59:16,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:16,698 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-01-25 05:59:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 05:59:16,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 131 [2018-01-25 05:59:16,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:16,700 INFO L225 Difference]: With dead ends: 208 [2018-01-25 05:59:16,700 INFO L226 Difference]: Without dead ends: 207 [2018-01-25 05:59:16,702 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 471 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=842, Invalid=3988, Unknown=0, NotChecked=0, Total=4830 [2018-01-25 05:59:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-25 05:59:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 195. [2018-01-25 05:59:16,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-25 05:59:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2018-01-25 05:59:16,717 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 131 [2018-01-25 05:59:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:16,718 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2018-01-25 05:59:16,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-25 05:59:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2018-01-25 05:59:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-25 05:59:16,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:16,720 INFO L322 BasicCegarLoop]: trace histogram [19, 16, 16, 15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:16,720 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash -177564663, now seen corresponding path program 7 times [2018-01-25 05:59:16,721 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:16,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:16,721 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:16,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:16,722 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:16,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 379 proven. 80 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-25 05:59:17,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:17,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:17,070 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:17,070 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:17,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:17,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:17,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:17,075 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:17,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 629 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 05:59:17,219 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 655 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 05:59:17,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:17,394 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 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 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:17,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:17,398 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:17,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 629 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 05:59:17,491 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:17,616 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 22 [2018-01-25 05:59:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 655 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 05:59:17,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:17,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11, 11] total 25 [2018-01-25 05:59:17,881 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:17,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:59:17,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:59:17,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-01-25 05:59:17,881 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand 20 states. [2018-01-25 05:59:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:18,363 INFO L93 Difference]: Finished difference Result 324 states and 340 transitions. [2018-01-25 05:59:18,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:59:18,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-01-25 05:59:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:18,366 INFO L225 Difference]: With dead ends: 324 [2018-01-25 05:59:18,366 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 05:59:18,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 548 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 05:59:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 05:59:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2018-01-25 05:59:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-25 05:59:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 198 transitions. [2018-01-25 05:59:18,384 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 198 transitions. Word has length 143 [2018-01-25 05:59:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:18,385 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 198 transitions. [2018-01-25 05:59:18,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:59:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 198 transitions. [2018-01-25 05:59:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-01-25 05:59:18,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:18,388 INFO L322 BasicCegarLoop]: trace histogram [25, 21, 21, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:18,388 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash 267706226, now seen corresponding path program 8 times [2018-01-25 05:59:18,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:18,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:18,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:18,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:18,389 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:18,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 712 proven. 74 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 05:59:18,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:18,695 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:18,695 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:18,696 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:18,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:18,696 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:18,702 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:18,702 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:18,714 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:18,735 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:18,739 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:18,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 05:59:18,889 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 05:59:19,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:19,051 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 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 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:19,054 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:19,054 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:19,070 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:19,112 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:19,140 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:19,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 05:59:19,189 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 05:59:19,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:19,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15, 15, 15] total 37 [2018-01-25 05:59:19,323 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:19,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 05:59:19,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 05:59:19,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 05:59:19,324 INFO L87 Difference]: Start difference. First operand 192 states and 198 transitions. Second operand 30 states. [2018-01-25 05:59:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:20,062 INFO L93 Difference]: Finished difference Result 403 states and 428 transitions. [2018-01-25 05:59:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:59:20,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 185 [2018-01-25 05:59:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:20,065 INFO L225 Difference]: With dead ends: 403 [2018-01-25 05:59:20,065 INFO L226 Difference]: Without dead ends: 307 [2018-01-25 05:59:20,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 707 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 05:59:20,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-25 05:59:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 297. [2018-01-25 05:59:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-25 05:59:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 310 transitions. [2018-01-25 05:59:20,097 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 310 transitions. Word has length 185 [2018-01-25 05:59:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:20,098 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 310 transitions. [2018-01-25 05:59:20,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 05:59:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 310 transitions. [2018-01-25 05:59:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-01-25 05:59:20,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:20,100 INFO L322 BasicCegarLoop]: trace histogram [30, 25, 25, 24, 24, 24, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:20,100 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1222792877, now seen corresponding path program 9 times [2018-01-25 05:59:20,101 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:20,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:20,102 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:20,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:20,102 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:20,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 1261 proven. 413 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2018-01-25 05:59:20,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:20,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:20,618 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:20,619 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:20,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:20,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:20,632 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:59:20,632 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:59:20,645 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:20,649 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:20,653 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:20,658 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:20,665 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:20,673 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:20,675 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:20,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:20,682 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-25 05:59:20,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:20,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:20,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 817 proven. 92 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-01-25 05:59:21,138 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 795 proven. 114 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-01-25 05:59:21,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:21,522 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 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 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:21,525 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:59:21,525 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:59:21,546 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:21,560 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:21,588 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:21,627 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:21,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:21,831 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:59:21,858 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:21,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:21,869 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-25 05:59:21,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:21,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:21,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 883 proven. 92 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-01-25 05:59:22,269 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 819 proven. 156 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-01-25 05:59:22,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:22,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13, 17, 16] total 61 [2018-01-25 05:59:22,734 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:22,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-25 05:59:22,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-25 05:59:22,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3267, Unknown=0, NotChecked=0, Total=3660 [2018-01-25 05:59:22,736 INFO L87 Difference]: Start difference. First operand 297 states and 310 transitions. Second operand 33 states. [2018-01-25 05:59:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:25,395 INFO L93 Difference]: Finished difference Result 461 states and 483 transitions. [2018-01-25 05:59:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-25 05:59:25,395 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 221 [2018-01-25 05:59:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:25,396 INFO L225 Difference]: With dead ends: 461 [2018-01-25 05:59:25,396 INFO L226 Difference]: Without dead ends: 350 [2018-01-25 05:59:25,399 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 825 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4054 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1685, Invalid=10305, Unknown=0, NotChecked=0, Total=11990 [2018-01-25 05:59:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-01-25 05:59:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 342. [2018-01-25 05:59:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-25 05:59:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 349 transitions. [2018-01-25 05:59:25,424 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 349 transitions. Word has length 221 [2018-01-25 05:59:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:25,425 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 349 transitions. [2018-01-25 05:59:25,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-25 05:59:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 349 transitions. [2018-01-25 05:59:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-25 05:59:25,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:25,427 INFO L322 BasicCegarLoop]: trace histogram [38, 32, 32, 31, 31, 31, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:25,427 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1481262388, now seen corresponding path program 10 times [2018-01-25 05:59:25,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:25,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:25,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:25,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:25,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:25,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1886 proven. 677 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-01-25 05:59:26,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:26,062 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:26,062 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:26,063 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:26,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:26,063 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:26,068 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:59:26,068 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:59:26,120 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:26,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 2081 proven. 44 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-01-25 05:59:26,317 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1459 proven. 382 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-25 05:59:26,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:26,574 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 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 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:26,577 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 05:59:26,577 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 05:59:26,700 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:26,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 2081 proven. 44 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-01-25 05:59:26,746 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1459 proven. 382 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-25 05:59:26,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:26,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12, 12, 12] total 34 [2018-01-25 05:59:26,956 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:26,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-25 05:59:26,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-25 05:59:26,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 05:59:26,957 INFO L87 Difference]: Start difference. First operand 342 states and 349 transitions. Second operand 29 states. [2018-01-25 05:59:27,627 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 22 DAG size of output 20 [2018-01-25 05:59:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:28,203 INFO L93 Difference]: Finished difference Result 498 states and 506 transitions. [2018-01-25 05:59:28,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 05:59:28,203 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 275 [2018-01-25 05:59:28,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:28,205 INFO L225 Difference]: With dead ends: 498 [2018-01-25 05:59:28,205 INFO L226 Difference]: Without dead ends: 285 [2018-01-25 05:59:28,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1138 GetRequests, 1075 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2018-01-25 05:59:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-25 05:59:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-01-25 05:59:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-25 05:59:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-01-25 05:59:28,238 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 275 [2018-01-25 05:59:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:28,238 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-01-25 05:59:28,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-25 05:59:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-01-25 05:59:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-25 05:59:28,240 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:28,240 INFO L322 BasicCegarLoop]: trace histogram [39, 33, 33, 32, 32, 32, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:28,240 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1397576748, now seen corresponding path program 11 times [2018-01-25 05:59:28,241 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:28,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:28,241 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:28,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:28,242 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:28,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2416 proven. 425 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2018-01-25 05:59:28,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:28,856 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:28,856 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:28,856 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:28,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:28,857 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:28,861 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:59:28,862 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:28,876 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,878 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,881 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,886 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,891 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,898 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,905 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,913 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,921 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,928 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:28,929 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:28,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 1998 proven. 491 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-01-25 05:59:29,163 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2006 proven. 483 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-01-25 05:59:29,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:29,538 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 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 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:29,541 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 05:59:29,541 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:29,561 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:29,567 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:29,580 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:29,609 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:29,665 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:29,732 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:29,926 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:30,301 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:30,761 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:33,293 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:33,358 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:33,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2015 proven. 580 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-01-25 05:59:33,445 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2029 proven. 566 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-01-25 05:59:33,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:33,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19, 19, 19] total 50 [2018-01-25 05:59:33,688 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:33,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-25 05:59:33,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-25 05:59:33,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2133, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 05:59:33,689 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 36 states. [2018-01-25 05:59:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:34,899 INFO L93 Difference]: Finished difference Result 361 states and 366 transitions. [2018-01-25 05:59:34,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-25 05:59:34,899 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 281 [2018-01-25 05:59:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:34,901 INFO L225 Difference]: With dead ends: 361 [2018-01-25 05:59:34,901 INFO L226 Difference]: Without dead ends: 304 [2018-01-25 05:59:34,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1085 SyntacticMatches, 19 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=918, Invalid=4782, Unknown=0, NotChecked=0, Total=5700 [2018-01-25 05:59:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-25 05:59:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 295. [2018-01-25 05:59:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-25 05:59:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-01-25 05:59:34,935 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 281 [2018-01-25 05:59:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:34,936 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-01-25 05:59:34,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-25 05:59:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-01-25 05:59:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-01-25 05:59:34,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:34,938 INFO L322 BasicCegarLoop]: trace histogram [40, 34, 34, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:34,938 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash -825440932, now seen corresponding path program 12 times [2018-01-25 05:59:34,938 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:34,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:34,939 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:34,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:34,939 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:34,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1170 proven. 114 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:35,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:35,427 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:35,428 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:35,428 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:35,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:35,428 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:35,441 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:59:35,441 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:59:35,465 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,470 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,476 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,479 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,486 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,494 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,504 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,515 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,527 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,541 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,558 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:35,562 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:35,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:35,571 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-25 05:59:35,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:35,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:35,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1264 proven. 821 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2018-01-25 05:59:36,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1206 proven. 172 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2018-01-25 05:59:36,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:36,597 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 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 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:36,599 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 05:59:36,600 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 05:59:36,620 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:36,630 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:36,646 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:36,667 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:36,701 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:36,777 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:36,924 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:37,151 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:37,537 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:38,372 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:39,668 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 05:59:39,731 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:39,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:39,749 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-25 05:59:39,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:39,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:39,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1170 proven. 114 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:40,147 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1170 proven. 114 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:40,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:40,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 16, 11, 10] total 60 [2018-01-25 05:59:40,458 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:40,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-25 05:59:40,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-25 05:59:40,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=3059, Unknown=0, NotChecked=0, Total=3660 [2018-01-25 05:59:40,460 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 33 states. [2018-01-25 05:59:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:41,312 INFO L93 Difference]: Finished difference Result 306 states and 308 transitions. [2018-01-25 05:59:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 05:59:41,312 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 287 [2018-01-25 05:59:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:41,314 INFO L225 Difference]: With dead ends: 306 [2018-01-25 05:59:41,314 INFO L226 Difference]: Without dead ends: 305 [2018-01-25 05:59:41,316 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1075 SyntacticMatches, 24 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1109, Invalid=5053, Unknown=0, NotChecked=0, Total=6162 [2018-01-25 05:59:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-25 05:59:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 297. [2018-01-25 05:59:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-25 05:59:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 299 transitions. [2018-01-25 05:59:41,345 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 299 transitions. Word has length 287 [2018-01-25 05:59:41,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:41,346 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 299 transitions. [2018-01-25 05:59:41,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-25 05:59:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 299 transitions. [2018-01-25 05:59:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-25 05:59:41,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:41,347 INFO L322 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:41,347 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 13 times [2018-01-25 05:59:41,347 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:41,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:41,348 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:59:41,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:41,348 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:41,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:41,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:41,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:41,872 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:41,872 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:41,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:41,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:41,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:41,878 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:41,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:41,958 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-25 05:59:41,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:41,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:41,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:42,521 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:42,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:42,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 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 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:42,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:42,875 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:43,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:43,007 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-25 05:59:43,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:59:43,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:59:43,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:59:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:43,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-25 05:59:43,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:59:43,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 12, 11] total 30 [2018-01-25 05:59:43,442 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:59:43,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 05:59:43,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 05:59:43,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-01-25 05:59:43,443 INFO L87 Difference]: Start difference. First operand 297 states and 299 transitions. Second operand 21 states. [2018-01-25 05:59:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:59:43,937 INFO L93 Difference]: Finished difference Result 322 states and 326 transitions. [2018-01-25 05:59:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:59:43,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-01-25 05:59:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:59:43,940 INFO L225 Difference]: With dead ends: 322 [2018-01-25 05:59:43,940 INFO L226 Difference]: Without dead ends: 321 [2018-01-25 05:59:43,941 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1126 SyntacticMatches, 27 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:59:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-25 05:59:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2018-01-25 05:59:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-01-25 05:59:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 306 transitions. [2018-01-25 05:59:43,972 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 306 transitions. Word has length 293 [2018-01-25 05:59:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:59:43,973 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 306 transitions. [2018-01-25 05:59:43,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 05:59:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 306 transitions. [2018-01-25 05:59:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-25 05:59:43,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:59:43,975 INFO L322 BasicCegarLoop]: trace histogram [42, 36, 36, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:59:43,975 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 05:59:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 14 times [2018-01-25 05:59:43,976 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:59:43,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:43,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:43,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:59:43,977 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:59:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:44,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:59:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1688 proven. 144 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-25 05:59:44,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:44,581 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:59:44,581 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:59:44,581 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:44,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:44,581 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:59:44,588 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:44,588 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:59:44,606 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:44,648 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:44,655 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:44,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1718 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-25 05:59:44,935 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:59:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1718 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-25 05:59:45,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:45,182 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 36 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 36 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:59:45,185 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:59:45,185 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) Received shutdown request... [2018-01-25 05:59:45,211 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:45,275 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:59:45,320 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:59:45,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:45,330 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:59:45,330 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:59:45,334 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:59:45,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:59:45 BoogieIcfgContainer [2018-01-25 05:59:45,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:59:45,336 INFO L168 Benchmark]: Toolchain (without parser) took 43880.31 ms. Allocated memory was 301.5 MB in the beginning and 1.0 GB in the end (delta: 708.8 MB). Free memory was 262.5 MB in the beginning and 597.9 MB in the end (delta: -335.3 MB). Peak memory consumption was 373.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:45,337 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:59:45,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.77 ms. Allocated memory is still 301.5 MB. Free memory was 261.5 MB in the beginning and 253.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:45,337 INFO L168 Benchmark]: Boogie Preprocessor took 31.17 ms. Allocated memory is still 301.5 MB. Free memory was 253.5 MB in the beginning and 251.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:45,337 INFO L168 Benchmark]: RCFGBuilder took 257.59 ms. Allocated memory is still 301.5 MB. Free memory was 251.4 MB in the beginning and 236.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:45,338 INFO L168 Benchmark]: TraceAbstraction took 43422.22 ms. Allocated memory was 301.5 MB in the beginning and 1.0 GB in the end (delta: 708.8 MB). Free memory was 235.7 MB in the beginning and 597.9 MB in the end (delta: -362.2 MB). Peak memory consumption was 346.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:45,339 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.17 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.77 ms. Allocated memory is still 301.5 MB. Free memory was 261.5 MB in the beginning and 253.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.17 ms. Allocated memory is still 301.5 MB. Free memory was 253.5 MB in the beginning and 251.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 257.59 ms. Allocated memory is still 301.5 MB. Free memory was 251.4 MB in the beginning and 236.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43422.22 ms. Allocated memory was 301.5 MB in the beginning and 1.0 GB in the end (delta: 708.8 MB). Free memory was 235.7 MB in the beginning and 597.9 MB in the end (delta: -362.2 MB). Peak memory consumption was 346.6 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.780496 RENAME_VARIABLES(MILLISECONDS) : 0.440989 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.713691 PROJECTAWAY(MILLISECONDS) : 0.402848 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.182794 DISJOIN(MILLISECONDS) : 2.418568 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.492320 ADD_EQUALITY(MILLISECONDS) : 0.048527 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.043373 #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) : 1.183450 RENAME_VARIABLES(MILLISECONDS) : 0.426773 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.115574 PROJECTAWAY(MILLISECONDS) : 0.243336 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.151275 DISJOIN(MILLISECONDS) : 0.326517 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.463250 ADD_EQUALITY(MILLISECONDS) : 0.060425 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032259 #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 : 60 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.826607 RENAME_VARIABLES(MILLISECONDS) : 0.258583 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.791208 PROJECTAWAY(MILLISECONDS) : 0.183200 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.093017 DISJOIN(MILLISECONDS) : 0.315599 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.284476 ADD_EQUALITY(MILLISECONDS) : 0.027857 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011528 #CONJOIN_DISJUNCTIVE : 172 #RENAME_VARIABLES : 379 #UNFREEZE : 0 #CONJOIN : 250 #PROJECTAWAY : 249 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 379 #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 : 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.651357 RENAME_VARIABLES(MILLISECONDS) : 0.208834 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.623542 PROJECTAWAY(MILLISECONDS) : 0.142954 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.084536 DISJOIN(MILLISECONDS) : 0.239043 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.227797 ADD_EQUALITY(MILLISECONDS) : 0.021997 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019436 #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.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 300 with TraceHistMax 42, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 300 with TraceHistMax 42, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 300 with TraceHistMax 42, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 300 with TraceHistMax 42, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 300 with TraceHistMax 42, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 300 with TraceHistMax 42, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 43.3s OverallTime, 23 OverallIterations, 42 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 723 SDtfs, 3419 SDslu, 4326 SDs, 0 SdLazy, 6272 SolverSat, 590 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10027 GetRequests, 9103 SyntacticMatches, 195 SemanticMatches, 729 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15049 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 201 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 7319 NumberOfCodeBlocks, 7049 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 12032 ConstructedInterpolants, 1462 QuantifiedInterpolants, 10953620 SizeOfPredicates, 116 NumberOfNonLiveVariables, 10466 ConjunctsInSsa, 488 ConjunctsInUnsatCore, 88 InterpolantComputations, 9 PerfectInterpolantSequences, 101506/110226 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-59-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-59-45-351.csv Completed graceful shutdown