java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:39:31,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:39:31,446 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:39:31,463 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:39:31,463 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:39:31,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:39:31,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:39:31,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:39:31,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:39:31,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:39:31,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:39:31,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:39:31,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:39:31,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:39:31,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:39:31,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:39:31,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:39:31,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:39:31,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:39:31,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:39:31,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:39:31,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:39:31,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:39:31,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:39:31,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:39:31,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:39:31,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:39:31,491 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:39:31,491 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:39:31,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:39:31,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:39:31,492 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:39:31,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:39:31,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:39:31,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:39:31,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:39:31,509 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:39:31,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:39:31,509 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:39:31,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:39:31,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:39:31,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:39:31,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:39:31,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:39:31,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:39:31,511 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:39:31,511 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:39:31,511 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:39:31,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:39:31,512 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:39:31,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:39:31,512 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:39:31,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:39:31,512 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:39:31,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:39:31,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:39:31,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:39:31,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:39:31,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:39:31,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:39:31,514 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:39:31,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:39:31,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:39:31,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:39:31,515 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:39:31,515 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:39:31,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:39:31,583 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:39:31,588 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:39:31,590 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:39:31,590 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:39:31,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-01-31 08:39:31,729 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:39:31,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:39:31,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:39:31,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:39:31,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:39:31,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:31,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d782bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31, skipping insertion in model container [2018-01-31 08:39:31,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:31,777 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:39:31,797 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:39:31,961 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:39:31,986 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:39:31,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31 WrapperNode [2018-01-31 08:39:31,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:39:31,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:39:31,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:39:31,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:39:32,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (1/1) ... [2018-01-31 08:39:32,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:39:32,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:39:32,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:39:32,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:39:32,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (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-31 08:39:32,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:39:32,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:39:32,109 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 08:39:32,109 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:39:32,109 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:39:32,109 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:39:32,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:39:32,567 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:39:32,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:39:32 BoogieIcfgContainer [2018-01-31 08:39:32,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:39:32,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:39:32,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:39:32,572 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:39:32,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:39:31" (1/3) ... [2018-01-31 08:39:32,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da889b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:39:32, skipping insertion in model container [2018-01-31 08:39:32,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:39:31" (2/3) ... [2018-01-31 08:39:32,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da889b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:39:32, skipping insertion in model container [2018-01-31 08:39:32,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:39:32" (3/3) ... [2018-01-31 08:39:32,575 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-01-31 08:39:32,584 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:39:32,591 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 08:39:32,638 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:39:32,640 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:39:32,640 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:39:32,640 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:39:32,640 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:39:32,641 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:39:32,641 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:39:32,641 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:39:32,642 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:39:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 08:39:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-31 08:39:32,683 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:32,684 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:32,684 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1628091867, now seen corresponding path program 1 times [2018-01-31 08:39:32,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:32,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:32,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:32,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:32,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:32,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:32,997 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-31 08:39:33,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:33,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:39:33,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:39:33,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:39:33,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:33,022 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-31 08:39:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:33,164 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2018-01-31 08:39:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:39:33,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-31 08:39:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:33,176 INFO L225 Difference]: With dead ends: 133 [2018-01-31 08:39:33,176 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:39:33,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:39:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:39:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 08:39:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 08:39:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-31 08:39:33,315 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 13 [2018-01-31 08:39:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:33,315 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-31 08:39:33,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:39:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-31 08:39:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:39:33,317 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:33,318 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:33,318 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1198271325, now seen corresponding path program 1 times [2018-01-31 08:39:33,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:33,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:33,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:33,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:33,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:33,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:33,737 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-31 08:39:33,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:33,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:39:33,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:39:33,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:39:33,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:33,760 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-01-31 08:39:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:34,165 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-31 08:39:34,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:39:34,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-31 08:39:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:34,169 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:39:34,170 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:39:34,170 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:39:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2018-01-31 08:39:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 08:39:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-31 08:39:34,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 22 [2018-01-31 08:39:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:34,181 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-31 08:39:34,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:39:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-31 08:39:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:39:34,182 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:34,183 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:34,183 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294640, now seen corresponding path program 1 times [2018-01-31 08:39:34,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:34,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:34,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:34,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:34,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:34,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:34,262 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-31 08:39:34,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:34,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:39:34,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:39:34,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:39:34,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:39:34,264 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-01-31 08:39:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:34,373 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-31 08:39:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:39:34,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-31 08:39:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:34,375 INFO L225 Difference]: With dead ends: 67 [2018-01-31 08:39:34,375 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 08:39:34,375 INFO L554 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-31 08:39:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 08:39:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-31 08:39:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:39:34,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-31 08:39:34,383 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 23 [2018-01-31 08:39:34,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:34,383 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-31 08:39:34,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:39:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-31 08:39:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:39:34,384 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:34,384 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:34,385 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1508294641, now seen corresponding path program 1 times [2018-01-31 08:39:34,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:34,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:34,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:34,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:34,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:34,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:34,808 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:39:34,810 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-31 08:39:34,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:39:34,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:39:34,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:39:34,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:39:34,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:39:34,812 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-01-31 08:39:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:35,022 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-31 08:39:35,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:35,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:39:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:35,024 INFO L225 Difference]: With dead ends: 75 [2018-01-31 08:39:35,024 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 08:39:35,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:39:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 08:39:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-01-31 08:39:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 08:39:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-31 08:39:35,033 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2018-01-31 08:39:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:35,034 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-31 08:39:35,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:39:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-31 08:39:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:39:35,035 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:35,035 INFO L351 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] [2018-01-31 08:39:35,035 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1757973218, now seen corresponding path program 1 times [2018-01-31 08:39:35,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:35,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:35,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:35,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:35,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:35,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:35,125 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-31 08:39:35,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:35,126 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:35,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:35,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:35,190 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-31 08:39:35,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:35,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-31 08:39:35,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:39:35,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:39:35,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:39:35,215 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-01-31 08:39:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:35,290 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-01-31 08:39:35,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:39:35,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-31 08:39:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:35,292 INFO L225 Difference]: With dead ends: 88 [2018-01-31 08:39:35,292 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:39:35,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:39:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2018-01-31 08:39:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:39:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-31 08:39:35,304 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 31 [2018-01-31 08:39:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:35,304 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-31 08:39:35,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:39:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-31 08:39:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 08:39:35,305 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:35,306 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:35,306 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1337405038, now seen corresponding path program 1 times [2018-01-31 08:39:35,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:35,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:35,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:35,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:35,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:35,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:35,659 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 15 DAG size of output 11 [2018-01-31 08:39:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:35,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:35,691 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:35,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:35,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:35,776 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-31 08:39:35,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:35,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:35,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:36,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:36,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-31 08:39:36,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:39:36,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:39:36,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:39:36,010 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-01-31 08:39:36,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:36,605 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-31 08:39:36,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:36,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-01-31 08:39:36,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:36,607 INFO L225 Difference]: With dead ends: 87 [2018-01-31 08:39:36,607 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:39:36,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:39:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-01-31 08:39:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 08:39:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-31 08:39:36,615 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 32 [2018-01-31 08:39:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:36,616 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-31 08:39:36,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:39:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-31 08:39:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 08:39:36,617 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:36,617 INFO L351 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] [2018-01-31 08:39:36,618 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash 254608978, now seen corresponding path program 1 times [2018-01-31 08:39:36,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:36,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:36,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:36,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:36,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:36,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:36,795 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-31 08:39:36,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:36,795 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:39:36,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:36,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:36,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:36,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2018-01-31 08:39:36,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:39:36,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:39:36,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:39:36,909 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 10 states. [2018-01-31 08:39:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:37,133 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-01-31 08:39:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:39:37,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-31 08:39:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:37,134 INFO L225 Difference]: With dead ends: 168 [2018-01-31 08:39:37,134 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 08:39:37,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 08:39:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2018-01-31 08:39:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-31 08:39:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-01-31 08:39:37,145 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 33 [2018-01-31 08:39:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:37,145 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-01-31 08:39:37,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:39:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-01-31 08:39:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:39:37,148 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:37,148 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:37,148 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:37,148 INFO L82 PathProgramCache]: Analyzing trace with hash 127101827, now seen corresponding path program 2 times [2018-01-31 08:39:37,148 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:37,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:37,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:37,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:37,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:37,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:37,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:37,478 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:37,483 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:37,496 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:37,516 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:37,524 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:37,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:39:38,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:38,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2018-01-31 08:39:38,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:39:38,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:39:38,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:39:38,078 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 16 states. [2018-01-31 08:39:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:38,415 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2018-01-31 08:39:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:39:38,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-01-31 08:39:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:38,417 INFO L225 Difference]: With dead ends: 208 [2018-01-31 08:39:38,417 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 08:39:38,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:39:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 08:39:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-01-31 08:39:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:39:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-01-31 08:39:38,435 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 40 [2018-01-31 08:39:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:38,436 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-01-31 08:39:38,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:39:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-01-31 08:39:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:39:38,438 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:38,439 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:38,439 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 324897333, now seen corresponding path program 1 times [2018-01-31 08:39:38,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:38,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:38,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:38,441 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:38,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:38,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:38,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:38,703 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:38,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:38,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:38,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:38,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-01-31 08:39:38,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:39:38,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:39:38,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:39:38,815 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 12 states. [2018-01-31 08:39:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:39,037 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-01-31 08:39:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:39:39,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-01-31 08:39:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:39,039 INFO L225 Difference]: With dead ends: 214 [2018-01-31 08:39:39,039 INFO L226 Difference]: Without dead ends: 135 [2018-01-31 08:39:39,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:39:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-31 08:39:39,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2018-01-31 08:39:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:39:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-31 08:39:39,055 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 69 [2018-01-31 08:39:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:39,055 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-31 08:39:39,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:39:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-31 08:39:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-31 08:39:39,060 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:39,060 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:39,060 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1935939050, now seen corresponding path program 2 times [2018-01-31 08:39:39,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:39,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:39,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:39,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:39,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:39,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-31 08:39:39,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:39,393 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:39,399 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:39,412 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:39,439 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:39,456 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:39,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-31 08:39:39,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:39,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 08:39:39,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:39:39,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:39:39,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:39:39,627 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 7 states. [2018-01-31 08:39:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:39,951 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-01-31 08:39:39,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:39,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2018-01-31 08:39:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:39,953 INFO L225 Difference]: With dead ends: 139 [2018-01-31 08:39:39,953 INFO L226 Difference]: Without dead ends: 138 [2018-01-31 08:39:39,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:39:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-31 08:39:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2018-01-31 08:39:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-31 08:39:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 133 transitions. [2018-01-31 08:39:39,963 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 133 transitions. Word has length 78 [2018-01-31 08:39:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:39,963 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 133 transitions. [2018-01-31 08:39:39,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:39:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2018-01-31 08:39:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:39:39,965 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:39,965 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:39,965 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash 115431646, now seen corresponding path program 1 times [2018-01-31 08:39:39,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:39,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:39,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:39,967 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:39,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:39,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:40,524 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:39:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-31 08:39:40,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:40,806 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:40,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:40,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:40,850 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-31 08:39:40,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:40,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:40,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 55 proven. 17 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 08:39:41,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:41,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-01-31 08:39:41,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:39:41,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:39:41,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:39:41,467 INFO L87 Difference]: Start difference. First operand 126 states and 133 transitions. Second operand 22 states. [2018-01-31 08:39:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:42,672 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2018-01-31 08:39:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:39:42,672 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 79 [2018-01-31 08:39:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:42,674 INFO L225 Difference]: With dead ends: 197 [2018-01-31 08:39:42,675 INFO L226 Difference]: Without dead ends: 192 [2018-01-31 08:39:42,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:39:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-31 08:39:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 143. [2018-01-31 08:39:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-31 08:39:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2018-01-31 08:39:42,687 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 79 [2018-01-31 08:39:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:42,688 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2018-01-31 08:39:42,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:39:42,688 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2018-01-31 08:39:42,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:39:42,689 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:42,689 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:42,690 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:42,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1952094074, now seen corresponding path program 1 times [2018-01-31 08:39:42,690 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:42,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:42,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:42,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:42,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:42,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:42,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:42,910 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:42,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:42,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:43,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:43,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-31 08:39:43,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:39:43,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:39:43,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:39:43,025 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 15 states. [2018-01-31 08:39:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:43,344 INFO L93 Difference]: Finished difference Result 249 states and 262 transitions. [2018-01-31 08:39:43,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:39:43,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2018-01-31 08:39:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:43,346 INFO L225 Difference]: With dead ends: 249 [2018-01-31 08:39:43,346 INFO L226 Difference]: Without dead ends: 168 [2018-01-31 08:39:43,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:39:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-31 08:39:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2018-01-31 08:39:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-31 08:39:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 157 transitions. [2018-01-31 08:39:43,357 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 157 transitions. Word has length 80 [2018-01-31 08:39:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:43,357 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 157 transitions. [2018-01-31 08:39:43,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:39:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 157 transitions. [2018-01-31 08:39:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-31 08:39:43,359 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:43,359 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:43,359 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash -310174977, now seen corresponding path program 2 times [2018-01-31 08:39:43,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:43,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:43,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:43,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:43,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:43,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-31 08:39:43,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:43,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:43,492 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:43,502 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:43,514 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:43,518 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:43,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 68 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:39:43,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:43,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-01-31 08:39:43,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:39:43,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:39:43,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:39:43,709 INFO L87 Difference]: Start difference. First operand 152 states and 157 transitions. Second operand 17 states. [2018-01-31 08:39:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:44,163 INFO L93 Difference]: Finished difference Result 263 states and 273 transitions. [2018-01-31 08:39:44,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:39:44,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 89 [2018-01-31 08:39:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:44,165 INFO L225 Difference]: With dead ends: 263 [2018-01-31 08:39:44,165 INFO L226 Difference]: Without dead ends: 185 [2018-01-31 08:39:44,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:39:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-31 08:39:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2018-01-31 08:39:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-31 08:39:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-01-31 08:39:44,180 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 89 [2018-01-31 08:39:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:44,180 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-01-31 08:39:44,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:39:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-01-31 08:39:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-31 08:39:44,181 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:44,181 INFO L351 BasicCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:44,181 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1033388843, now seen corresponding path program 1 times [2018-01-31 08:39:44,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:44,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:44,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:44,182 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:44,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:44,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 08:39:44,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:44,270 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:44,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:44,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-31 08:39:44,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:44,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 08:39:44,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:39:44,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:39:44,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:39:44,365 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 9 states. [2018-01-31 08:39:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:44,425 INFO L93 Difference]: Finished difference Result 203 states and 210 transitions. [2018-01-31 08:39:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:39:44,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-01-31 08:39:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:44,427 INFO L225 Difference]: With dead ends: 203 [2018-01-31 08:39:44,427 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:39:44,427 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:39:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2018-01-31 08:39:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-31 08:39:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2018-01-31 08:39:44,436 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 106 [2018-01-31 08:39:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:44,436 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2018-01-31 08:39:44,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:39:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2018-01-31 08:39:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-01-31 08:39:44,438 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:44,438 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:44,438 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:44,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2126374397, now seen corresponding path program 3 times [2018-01-31 08:39:44,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:44,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:44,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:44,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:44,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:44,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 166 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-01-31 08:39:45,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:45,479 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:45,484 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:45,499 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:45,504 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:45,510 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:45,511 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:45,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 176 proven. 37 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-31 08:39:45,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:45,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2018-01-31 08:39:45,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:39:45,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:39:45,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:39:45,913 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand 22 states. [2018-01-31 08:39:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:46,714 INFO L93 Difference]: Finished difference Result 274 states and 285 transitions. [2018-01-31 08:39:46,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:39:46,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 134 [2018-01-31 08:39:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:46,716 INFO L225 Difference]: With dead ends: 274 [2018-01-31 08:39:46,716 INFO L226 Difference]: Without dead ends: 273 [2018-01-31 08:39:46,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=353, Invalid=2097, Unknown=0, NotChecked=0, Total=2450 [2018-01-31 08:39:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-31 08:39:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 217. [2018-01-31 08:39:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-01-31 08:39:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 224 transitions. [2018-01-31 08:39:46,733 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 224 transitions. Word has length 134 [2018-01-31 08:39:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:46,733 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 224 transitions. [2018-01-31 08:39:46,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:39:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 224 transitions. [2018-01-31 08:39:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-01-31 08:39:46,734 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:46,735 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:46,735 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1493096815, now seen corresponding path program 2 times [2018-01-31 08:39:46,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:46,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:46,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:46,737 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:46,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:46,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-31 08:39:47,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:47,135 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:47,142 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:47,154 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:47,168 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:47,170 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:47,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:47,176 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-31 08:39:47,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:47,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:47,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 181 proven. 39 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-01-31 08:39:47,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:47,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-01-31 08:39:47,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:39:47,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:39:47,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:39:47,439 INFO L87 Difference]: Start difference. First operand 217 states and 224 transitions. Second operand 13 states. [2018-01-31 08:39:47,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:47,962 INFO L93 Difference]: Finished difference Result 260 states and 270 transitions. [2018-01-31 08:39:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:39:47,962 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 135 [2018-01-31 08:39:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:47,963 INFO L225 Difference]: With dead ends: 260 [2018-01-31 08:39:47,963 INFO L226 Difference]: Without dead ends: 259 [2018-01-31 08:39:47,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:39:47,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-31 08:39:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 227. [2018-01-31 08:39:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-01-31 08:39:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 235 transitions. [2018-01-31 08:39:47,976 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 235 transitions. Word has length 135 [2018-01-31 08:39:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:47,977 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 235 transitions. [2018-01-31 08:39:47,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:39:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 235 transitions. [2018-01-31 08:39:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-31 08:39:47,979 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:47,979 INFO L351 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:47,979 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1902632690, now seen corresponding path program 3 times [2018-01-31 08:39:47,979 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:47,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:47,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:47,980 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:47,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:48,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 275 proven. 26 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-31 08:39:48,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:48,413 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:48,418 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:39:48,431 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:48,436 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:48,441 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:39:48,443 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:48,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:48,457 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-31 08:39:48,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:48,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:48,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 253 proven. 26 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-31 08:39:48,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:48,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-01-31 08:39:48,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:39:48,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:39:48,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:48,859 INFO L87 Difference]: Start difference. First operand 227 states and 235 transitions. Second operand 31 states. [2018-01-31 08:39:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:49,674 INFO L93 Difference]: Finished difference Result 239 states and 247 transitions. [2018-01-31 08:39:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:39:49,674 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 144 [2018-01-31 08:39:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:49,676 INFO L225 Difference]: With dead ends: 239 [2018-01-31 08:39:49,676 INFO L226 Difference]: Without dead ends: 238 [2018-01-31 08:39:49,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=421, Invalid=1741, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:39:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-31 08:39:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 216. [2018-01-31 08:39:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-31 08:39:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 222 transitions. [2018-01-31 08:39:49,691 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 222 transitions. Word has length 144 [2018-01-31 08:39:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:49,692 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 222 transitions. [2018-01-31 08:39:49,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:39:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 222 transitions. [2018-01-31 08:39:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-01-31 08:39:49,693 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:49,693 INFO L351 BasicCegarLoop]: trace histogram [11, 8, 8, 8, 8, 8, 8, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:49,693 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1502561417, now seen corresponding path program 2 times [2018-01-31 08:39:49,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:49,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:49,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:49,695 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:49,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:49,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-01-31 08:39:50,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:50,127 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:39:50,133 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:39:50,145 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:39:50,148 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:50,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:50,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:50,341 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-31 08:39:50,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:50,343 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-31 08:39:50,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:50,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:50,384 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-31 08:39:50,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:50,385 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-31 08:39:50,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:50,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:39:50,424 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-31 08:39:50,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:50,426 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-31 08:39:50,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-31 08:39:50,467 WARN L1033 $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-31 08:39:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-01-31 08:39:50,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:39:50,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-01-31 08:39:50,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:39:50,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:39:50,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-01-31 08:39:50,526 INFO L87 Difference]: Start difference. First operand 216 states and 222 transitions. Second operand 13 states. [2018-01-31 08:39:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:51,750 INFO L93 Difference]: Finished difference Result 258 states and 269 transitions. [2018-01-31 08:39:51,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:39:51,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-01-31 08:39:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:51,752 INFO L225 Difference]: With dead ends: 258 [2018-01-31 08:39:51,752 INFO L226 Difference]: Without dead ends: 226 [2018-01-31 08:39:51,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-01-31 08:39:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-31 08:39:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2018-01-31 08:39:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-31 08:39:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 221 transitions. [2018-01-31 08:39:51,785 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 221 transitions. Word has length 153 [2018-01-31 08:39:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:51,786 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 221 transitions. [2018-01-31 08:39:51,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:39:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 221 transitions. [2018-01-31 08:39:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-31 08:39:51,788 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:51,788 INFO L351 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:51,788 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1190877366, now seen corresponding path program 4 times [2018-01-31 08:39:51,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:51,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:51,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:51,790 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:51,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:51,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 357 proven. 75 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-01-31 08:39:52,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:52,152 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:52,157 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:39:52,194 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:52,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 572 proven. 33 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-31 08:39:52,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:52,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-31 08:39:52,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:39:52,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:39:52,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:39:52,466 INFO L87 Difference]: Start difference. First operand 216 states and 221 transitions. Second operand 31 states. [2018-01-31 08:39:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:54,369 INFO L93 Difference]: Finished difference Result 418 states and 433 transitions. [2018-01-31 08:39:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-31 08:39:54,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 190 [2018-01-31 08:39:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:54,405 INFO L225 Difference]: With dead ends: 418 [2018-01-31 08:39:54,405 INFO L226 Difference]: Without dead ends: 329 [2018-01-31 08:39:54,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2762 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1254, Invalid=7118, Unknown=0, NotChecked=0, Total=8372 [2018-01-31 08:39:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-31 08:39:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 283. [2018-01-31 08:39:54,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-31 08:39:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 290 transitions. [2018-01-31 08:39:54,426 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 290 transitions. Word has length 190 [2018-01-31 08:39:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:54,426 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 290 transitions. [2018-01-31 08:39:54,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:39:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 290 transitions. [2018-01-31 08:39:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-01-31 08:39:54,428 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:54,428 INFO L351 BasicCegarLoop]: trace histogram [17, 14, 14, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:54,428 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1671045217, now seen corresponding path program 4 times [2018-01-31 08:39:54,428 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:54,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:54,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:54,430 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:54,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:54,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 405 proven. 79 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-01-31 08:39:54,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:54,994 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:39:54,998 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:39:55,037 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:39:55,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:55,043 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-31 08:39:55,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:39:55,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:39:55,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:39:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 323 proven. 336 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-01-31 08:39:55,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:55,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2018-01-31 08:39:55,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:39:55,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:39:55,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:39:55,913 INFO L87 Difference]: Start difference. First operand 283 states and 290 transitions. Second operand 33 states. [2018-01-31 08:39:58,120 WARN L146 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 22 DAG size of output 17 [2018-01-31 08:39:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:39:58,537 INFO L93 Difference]: Finished difference Result 377 states and 391 transitions. [2018-01-31 08:39:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-31 08:39:58,537 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 200 [2018-01-31 08:39:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:39:58,539 INFO L225 Difference]: With dead ends: 377 [2018-01-31 08:39:58,539 INFO L226 Difference]: Without dead ends: 375 [2018-01-31 08:39:58,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 180 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=959, Invalid=5047, Unknown=0, NotChecked=0, Total=6006 [2018-01-31 08:39:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-31 08:39:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 291. [2018-01-31 08:39:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-31 08:39:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 298 transitions. [2018-01-31 08:39:58,570 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 298 transitions. Word has length 200 [2018-01-31 08:39:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:39:58,571 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 298 transitions. [2018-01-31 08:39:58,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:39:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 298 transitions. [2018-01-31 08:39:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-31 08:39:58,572 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:39:58,572 INFO L351 BasicCegarLoop]: trace histogram [17, 13, 13, 13, 13, 13, 13, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:39:58,573 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:39:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1940595211, now seen corresponding path program 1 times [2018-01-31 08:39:58,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:39:58,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:39:58,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:58,574 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:39:58,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:39:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:58,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:39:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2018-01-31 08:39:58,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:39:58,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:39:58,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:39:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:39:58,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:39:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 458 proven. 62 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-01-31 08:39:59,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:39:59,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20] total 23 [2018-01-31 08:39:59,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-31 08:39:59,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-31 08:39:59,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:39:59,134 INFO L87 Difference]: Start difference. First operand 291 states and 298 transitions. Second operand 23 states. [2018-01-31 08:39:59,770 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 11 DAG size of output 9 [2018-01-31 08:40:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:00,117 INFO L93 Difference]: Finished difference Result 460 states and 476 transitions. [2018-01-31 08:40:00,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 08:40:00,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 220 [2018-01-31 08:40:00,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:00,120 INFO L225 Difference]: With dead ends: 460 [2018-01-31 08:40:00,120 INFO L226 Difference]: Without dead ends: 364 [2018-01-31 08:40:00,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=420, Invalid=2232, Unknown=0, NotChecked=0, Total=2652 [2018-01-31 08:40:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-31 08:40:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2018-01-31 08:40:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-01-31 08:40:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 313 transitions. [2018-01-31 08:40:00,139 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 313 transitions. Word has length 220 [2018-01-31 08:40:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:00,139 INFO L432 AbstractCegarLoop]: Abstraction has 307 states and 313 transitions. [2018-01-31 08:40:00,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-31 08:40:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 313 transitions. [2018-01-31 08:40:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-01-31 08:40:00,141 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:00,141 INFO L351 BasicCegarLoop]: trace histogram [18, 14, 14, 14, 14, 14, 14, 14, 14, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:00,141 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:00,141 INFO L82 PathProgramCache]: Analyzing trace with hash 111205615, now seen corresponding path program 2 times [2018-01-31 08:40:00,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:00,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:00,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:00,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:40:00,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:00,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2018-01-31 08:40:00,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:00,428 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:40:00,434 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:40:00,448 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:00,475 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:00,479 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:00,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2018-01-31 08:40:00,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:00,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 17 [2018-01-31 08:40:00,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:40:00,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:40:00,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:40:00,587 INFO L87 Difference]: Start difference. First operand 307 states and 313 transitions. Second operand 17 states. [2018-01-31 08:40:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:00,953 INFO L93 Difference]: Finished difference Result 343 states and 352 transitions. [2018-01-31 08:40:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:40:00,954 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 236 [2018-01-31 08:40:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:00,956 INFO L225 Difference]: With dead ends: 343 [2018-01-31 08:40:00,956 INFO L226 Difference]: Without dead ends: 303 [2018-01-31 08:40:00,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:40:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-31 08:40:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2018-01-31 08:40:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-01-31 08:40:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 293 transitions. [2018-01-31 08:40:00,975 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 293 transitions. Word has length 236 [2018-01-31 08:40:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:00,977 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 293 transitions. [2018-01-31 08:40:00,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:40:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 293 transitions. [2018-01-31 08:40:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-01-31 08:40:00,979 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:00,979 INFO L351 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 20, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:00,979 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:00,980 INFO L82 PathProgramCache]: Analyzing trace with hash -435929309, now seen corresponding path program 5 times [2018-01-31 08:40:00,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:00,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:00,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:00,981 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:00,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:01,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 874 proven. 119 refuted. 0 times theorem prover too weak. 1101 trivial. 0 not checked. [2018-01-31 08:40:02,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:02,278 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:02,286 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:40:02,308 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,328 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,346 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,366 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,385 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,399 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,411 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:02,413 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:02,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 1027 proven. 76 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2018-01-31 08:40:03,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:03,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 40 [2018-01-31 08:40:03,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 08:40:03,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 08:40:03,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1365, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:40:03,336 INFO L87 Difference]: Start difference. First operand 288 states and 293 transitions. Second operand 40 states. [2018-01-31 08:40:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:04,341 INFO L93 Difference]: Finished difference Result 653 states and 674 transitions. [2018-01-31 08:40:04,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 08:40:04,341 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 282 [2018-01-31 08:40:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:04,343 INFO L225 Difference]: With dead ends: 653 [2018-01-31 08:40:04,343 INFO L226 Difference]: Without dead ends: 442 [2018-01-31 08:40:04,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1496 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=877, Invalid=4525, Unknown=0, NotChecked=0, Total=5402 [2018-01-31 08:40:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-01-31 08:40:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 416. [2018-01-31 08:40:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-01-31 08:40:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 425 transitions. [2018-01-31 08:40:04,377 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 425 transitions. Word has length 282 [2018-01-31 08:40:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:04,378 INFO L432 AbstractCegarLoop]: Abstraction has 416 states and 425 transitions. [2018-01-31 08:40:04,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 08:40:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 425 transitions. [2018-01-31 08:40:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-01-31 08:40:04,380 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:04,381 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 25, 25, 25, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:04,381 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1110409045, now seen corresponding path program 6 times [2018-01-31 08:40:04,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:04,383 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:04,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:04,383 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:04,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:04,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1178 proven. 153 refuted. 0 times theorem prover too weak. 1949 trivial. 0 not checked. [2018-01-31 08:40:05,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:05,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:40:05,023 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:40:05,048 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,067 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,085 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,107 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,130 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,158 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,179 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,205 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:05,218 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:05,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1227 proven. 792 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2018-01-31 08:40:06,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:06,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 27] total 45 [2018-01-31 08:40:06,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 08:40:06,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 08:40:06,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1909, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 08:40:06,219 INFO L87 Difference]: Start difference. First operand 416 states and 425 transitions. Second operand 46 states. [2018-01-31 08:40:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:09,088 INFO L93 Difference]: Finished difference Result 665 states and 694 transitions. [2018-01-31 08:40:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-01-31 08:40:09,088 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 347 [2018-01-31 08:40:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:09,093 INFO L225 Difference]: With dead ends: 665 [2018-01-31 08:40:09,094 INFO L226 Difference]: Without dead ends: 664 [2018-01-31 08:40:09,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4148 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1840, Invalid=11500, Unknown=0, NotChecked=0, Total=13340 [2018-01-31 08:40:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-31 08:40:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 533. [2018-01-31 08:40:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-01-31 08:40:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 550 transitions. [2018-01-31 08:40:09,142 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 550 transitions. Word has length 347 [2018-01-31 08:40:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:09,143 INFO L432 AbstractCegarLoop]: Abstraction has 533 states and 550 transitions. [2018-01-31 08:40:09,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 08:40:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 550 transitions. [2018-01-31 08:40:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-01-31 08:40:09,146 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:09,147 INFO L351 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 25, 25, 25, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:09,147 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash 62942079, now seen corresponding path program 5 times [2018-01-31 08:40:09,147 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:09,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:09,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:09,150 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:09,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:09,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3305 backedges. 1197 proven. 159 refuted. 0 times theorem prover too weak. 1949 trivial. 0 not checked. [2018-01-31 08:40:10,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:10,304 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:10,309 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:40:10,334 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,354 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,377 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,394 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,413 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,421 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,428 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:10,430 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:10,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3305 backedges. 1937 proven. 499 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2018-01-31 08:40:12,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:12,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 29] total 46 [2018-01-31 08:40:12,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 08:40:12,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 08:40:12,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1899, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 08:40:12,072 INFO L87 Difference]: Start difference. First operand 533 states and 550 transitions. Second operand 46 states. [2018-01-31 08:40:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:13,935 INFO L93 Difference]: Finished difference Result 737 states and 767 transitions. [2018-01-31 08:40:13,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-31 08:40:13,935 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 348 [2018-01-31 08:40:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:13,938 INFO L225 Difference]: With dead ends: 737 [2018-01-31 08:40:13,939 INFO L226 Difference]: Without dead ends: 559 [2018-01-31 08:40:13,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1006, Invalid=6650, Unknown=0, NotChecked=0, Total=7656 [2018-01-31 08:40:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-01-31 08:40:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 536. [2018-01-31 08:40:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-01-31 08:40:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 550 transitions. [2018-01-31 08:40:13,984 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 550 transitions. Word has length 348 [2018-01-31 08:40:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:13,985 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 550 transitions. [2018-01-31 08:40:13,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 08:40:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 550 transitions. [2018-01-31 08:40:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-01-31 08:40:13,988 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:13,989 INFO L351 BasicCegarLoop]: trace histogram [33, 28, 28, 27, 27, 27, 27, 27, 27, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:13,989 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash 522985253, now seen corresponding path program 6 times [2018-01-31 08:40:13,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:13,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:13,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:13,990 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:13,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:14,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:14,734 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:40:15,117 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:40:15,795 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:40:16,071 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:40:16,343 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:40:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3792 backedges. 1489 proven. 134 refuted. 0 times theorem prover too weak. 2169 trivial. 0 not checked. [2018-01-31 08:40:16,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:16,927 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:40:16,934 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:40:16,952 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:16,959 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:16,965 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:16,980 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:16,987 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:16,997 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:17,006 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:17,017 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:40:17,019 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:17,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3792 backedges. 2161 proven. 556 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-01-31 08:40:17,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:17,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 37] total 56 [2018-01-31 08:40:17,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-31 08:40:17,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-31 08:40:17,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2790, Unknown=0, NotChecked=0, Total=3080 [2018-01-31 08:40:17,669 INFO L87 Difference]: Start difference. First operand 536 states and 550 transitions. Second operand 56 states. [2018-01-31 08:40:20,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:20,406 INFO L93 Difference]: Finished difference Result 746 states and 767 transitions. [2018-01-31 08:40:20,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-01-31 08:40:20,406 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 366 [2018-01-31 08:40:20,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:20,408 INFO L225 Difference]: With dead ends: 746 [2018-01-31 08:40:20,408 INFO L226 Difference]: Without dead ends: 644 [2018-01-31 08:40:20,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2065, Invalid=13435, Unknown=0, NotChecked=0, Total=15500 [2018-01-31 08:40:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-01-31 08:40:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 514. [2018-01-31 08:40:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-01-31 08:40:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 523 transitions. [2018-01-31 08:40:20,447 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 523 transitions. Word has length 366 [2018-01-31 08:40:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:20,448 INFO L432 AbstractCegarLoop]: Abstraction has 514 states and 523 transitions. [2018-01-31 08:40:20,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-31 08:40:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 523 transitions. [2018-01-31 08:40:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-01-31 08:40:20,451 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:20,451 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 34, 34, 34, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:20,451 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1577774173, now seen corresponding path program 7 times [2018-01-31 08:40:20,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:20,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:20,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:20,453 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:20,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:20,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5925 backedges. 1878 proven. 210 refuted. 0 times theorem prover too weak. 3837 trivial. 0 not checked. [2018-01-31 08:40:21,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:21,415 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:21,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:40:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:21,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5925 backedges. 1878 proven. 210 refuted. 0 times theorem prover too weak. 3837 trivial. 0 not checked. [2018-01-31 08:40:21,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:21,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-01-31 08:40:21,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:40:21,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:40:21,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:40:21,706 INFO L87 Difference]: Start difference. First operand 514 states and 523 transitions. Second operand 17 states. [2018-01-31 08:40:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:22,153 INFO L93 Difference]: Finished difference Result 550 states and 560 transitions. [2018-01-31 08:40:22,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:40:22,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 448 [2018-01-31 08:40:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:22,156 INFO L225 Difference]: With dead ends: 550 [2018-01-31 08:40:22,156 INFO L226 Difference]: Without dead ends: 549 [2018-01-31 08:40:22,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:40:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-01-31 08:40:22,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 522. [2018-01-31 08:40:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-01-31 08:40:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 532 transitions. [2018-01-31 08:40:22,194 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 532 transitions. Word has length 448 [2018-01-31 08:40:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:22,195 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 532 transitions. [2018-01-31 08:40:22,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:40:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 532 transitions. [2018-01-31 08:40:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-01-31 08:40:22,198 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:22,198 INFO L351 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 34, 34, 34, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:22,198 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1666359055, now seen corresponding path program 7 times [2018-01-31 08:40:22,199 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:22,199 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:22,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:22,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:40:22,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:22,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 2510 proven. 1004 refuted. 0 times theorem prover too weak. 2445 trivial. 0 not checked. [2018-01-31 08:40:24,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:24,211 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:40:24,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:40:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:24,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:24,316 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-31 08:40:24,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:40:24,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:40:24,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:40:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5959 backedges. 1935 proven. 217 refuted. 0 times theorem prover too weak. 3807 trivial. 0 not checked. [2018-01-31 08:40:25,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:25,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20] total 47 [2018-01-31 08:40:25,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-31 08:40:25,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-31 08:40:25,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2053, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 08:40:25,719 INFO L87 Difference]: Start difference. First operand 522 states and 532 transitions. Second operand 48 states. [2018-01-31 08:40:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:28,971 INFO L93 Difference]: Finished difference Result 653 states and 670 transitions. [2018-01-31 08:40:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-01-31 08:40:28,972 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 449 [2018-01-31 08:40:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:28,974 INFO L225 Difference]: With dead ends: 653 [2018-01-31 08:40:28,974 INFO L226 Difference]: Without dead ends: 651 [2018-01-31 08:40:28,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 421 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4063 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1763, Invalid=12279, Unknown=0, NotChecked=0, Total=14042 [2018-01-31 08:40:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-01-31 08:40:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 618. [2018-01-31 08:40:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-01-31 08:40:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 633 transitions. [2018-01-31 08:40:29,019 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 633 transitions. Word has length 449 [2018-01-31 08:40:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:29,020 INFO L432 AbstractCegarLoop]: Abstraction has 618 states and 633 transitions. [2018-01-31 08:40:29,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-31 08:40:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 633 transitions. [2018-01-31 08:40:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-01-31 08:40:29,025 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:29,025 INFO L351 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 42, 42, 42, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:29,025 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1314818710, now seen corresponding path program 8 times [2018-01-31 08:40:29,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:29,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:29,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:29,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:40:29,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:29,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8960 backedges. 2818 proven. 297 refuted. 0 times theorem prover too weak. 5845 trivial. 0 not checked. [2018-01-31 08:40:30,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:30,486 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:30,503 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:40:30,528 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:30,591 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:30,599 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:30,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8960 backedges. 4836 proven. 203 refuted. 0 times theorem prover too weak. 3921 trivial. 0 not checked. [2018-01-31 08:40:32,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:32,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 60 [2018-01-31 08:40:32,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-31 08:40:32,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-31 08:40:32,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3246, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:40:32,579 INFO L87 Difference]: Start difference. First operand 618 states and 633 transitions. Second operand 60 states. [2018-01-31 08:40:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:35,505 INFO L93 Difference]: Finished difference Result 1116 states and 1147 transitions. [2018-01-31 08:40:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-01-31 08:40:35,506 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 540 [2018-01-31 08:40:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:35,509 INFO L225 Difference]: With dead ends: 1116 [2018-01-31 08:40:35,509 INFO L226 Difference]: Without dead ends: 741 [2018-01-31 08:40:35,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8753 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2770, Invalid=20792, Unknown=0, NotChecked=0, Total=23562 [2018-01-31 08:40:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-01-31 08:40:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 703. [2018-01-31 08:40:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-01-31 08:40:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 713 transitions. [2018-01-31 08:40:35,563 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 713 transitions. Word has length 540 [2018-01-31 08:40:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:35,563 INFO L432 AbstractCegarLoop]: Abstraction has 703 states and 713 transitions. [2018-01-31 08:40:35,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-31 08:40:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 713 transitions. [2018-01-31 08:40:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-01-31 08:40:35,571 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:35,571 INFO L351 BasicCegarLoop]: trace histogram [51, 44, 44, 43, 43, 43, 43, 43, 43, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:35,572 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash 30237823, now seen corresponding path program 8 times [2018-01-31 08:40:35,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:35,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:35,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:35,573 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:35,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:35,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9398 backedges. 2821 proven. 284 refuted. 0 times theorem prover too weak. 6293 trivial. 0 not checked. [2018-01-31 08:40:37,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:37,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:40:37,332 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:40:37,356 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:37,417 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:40:37,435 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:37,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:37,466 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-31 08:40:37,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:40:37,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:40:37,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:40:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9398 backedges. 2821 proven. 284 refuted. 0 times theorem prover too weak. 6293 trivial. 0 not checked. [2018-01-31 08:40:38,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:38,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2018-01-31 08:40:38,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:40:38,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:40:38,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:40:38,918 INFO L87 Difference]: Start difference. First operand 703 states and 713 transitions. Second operand 39 states. [2018-01-31 08:40:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:39,944 INFO L93 Difference]: Finished difference Result 773 states and 787 transitions. [2018-01-31 08:40:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-31 08:40:39,944 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 550 [2018-01-31 08:40:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:39,946 INFO L225 Difference]: With dead ends: 773 [2018-01-31 08:40:39,946 INFO L226 Difference]: Without dead ends: 771 [2018-01-31 08:40:39,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 520 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-01-31 08:40:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-01-31 08:40:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 721. [2018-01-31 08:40:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-01-31 08:40:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 733 transitions. [2018-01-31 08:40:39,993 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 733 transitions. Word has length 550 [2018-01-31 08:40:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:39,994 INFO L432 AbstractCegarLoop]: Abstraction has 721 states and 733 transitions. [2018-01-31 08:40:39,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:40:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 733 transitions. [2018-01-31 08:40:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-01-31 08:40:39,998 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:39,999 INFO L351 BasicCegarLoop]: trace histogram [52, 45, 45, 44, 44, 44, 44, 44, 44, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:39,999 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:39,999 INFO L82 PathProgramCache]: Analyzing trace with hash 408382660, now seen corresponding path program 9 times [2018-01-31 08:40:39,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:39,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:40,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:40,000 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:40,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:40,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9803 backedges. 3150 proven. 360 refuted. 0 times theorem prover too weak. 6293 trivial. 0 not checked. [2018-01-31 08:40:41,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:41,601 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:40:41,615 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:41,648 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,665 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,707 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,729 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,749 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,762 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,779 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:41,782 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:41,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:41,807 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-31 08:40:41,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:40:41,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:40:41,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:40:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9803 backedges. 4694 proven. 959 refuted. 0 times theorem prover too weak. 4150 trivial. 0 not checked. [2018-01-31 08:40:43,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:43,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 52 [2018-01-31 08:40:43,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 08:40:43,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 08:40:43,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2469, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:40:43,168 INFO L87 Difference]: Start difference. First operand 721 states and 733 transitions. Second operand 53 states. [2018-01-31 08:40:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:48,634 INFO L93 Difference]: Finished difference Result 780 states and 794 transitions. [2018-01-31 08:40:48,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-01-31 08:40:48,635 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 559 [2018-01-31 08:40:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:48,638 INFO L225 Difference]: With dead ends: 780 [2018-01-31 08:40:48,638 INFO L226 Difference]: Without dead ends: 778 [2018-01-31 08:40:48,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 519 SyntacticMatches, 13 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9915 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3413, Invalid=22027, Unknown=0, NotChecked=0, Total=25440 [2018-01-31 08:40:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-01-31 08:40:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 719. [2018-01-31 08:40:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-01-31 08:40:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 730 transitions. [2018-01-31 08:40:48,693 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 730 transitions. Word has length 559 [2018-01-31 08:40:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:48,693 INFO L432 AbstractCegarLoop]: Abstraction has 719 states and 730 transitions. [2018-01-31 08:40:48,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 08:40:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 730 transitions. [2018-01-31 08:40:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-01-31 08:40:48,699 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:48,699 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 53, 53, 53, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:48,699 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash -753105432, now seen corresponding path program 9 times [2018-01-31 08:40:48,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:48,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:48,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:48,701 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:48,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:48,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14057 backedges. 4215 proven. 435 refuted. 0 times theorem prover too weak. 9407 trivial. 0 not checked. [2018-01-31 08:40:50,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:50,658 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:40:50,663 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:40:50,690 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,700 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,705 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,712 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,721 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,732 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,746 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,762 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:40:50,783 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:50,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14057 backedges. 4215 proven. 387 refuted. 0 times theorem prover too weak. 9455 trivial. 0 not checked. [2018-01-31 08:40:51,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:51,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 52 [2018-01-31 08:40:51,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 08:40:51,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 08:40:51,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2534, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:40:51,729 INFO L87 Difference]: Start difference. First operand 719 states and 730 transitions. Second operand 53 states. [2018-01-31 08:40:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:40:55,280 INFO L93 Difference]: Finished difference Result 933 states and 953 transitions. [2018-01-31 08:40:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-01-31 08:40:55,280 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 659 [2018-01-31 08:40:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:40:55,283 INFO L225 Difference]: With dead ends: 933 [2018-01-31 08:40:55,283 INFO L226 Difference]: Without dead ends: 932 [2018-01-31 08:40:55,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7227 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1933, Invalid=19529, Unknown=0, NotChecked=0, Total=21462 [2018-01-31 08:40:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-01-31 08:40:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 839. [2018-01-31 08:40:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-01-31 08:40:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 855 transitions. [2018-01-31 08:40:55,337 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 855 transitions. Word has length 659 [2018-01-31 08:40:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:40:55,338 INFO L432 AbstractCegarLoop]: Abstraction has 839 states and 855 transitions. [2018-01-31 08:40:55,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 08:40:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 855 transitions. [2018-01-31 08:40:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2018-01-31 08:40:55,344 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:40:55,344 INFO L351 BasicCegarLoop]: trace histogram [62, 54, 54, 53, 53, 53, 53, 53, 53, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:40:55,344 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:40:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1871431860, now seen corresponding path program 10 times [2018-01-31 08:40:55,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:40:55,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:40:55,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:55,346 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:40:55,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:40:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:40:55,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:40:57,172 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 14 DAG size of output 9 [2018-01-31 08:40:57,474 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 16 DAG size of output 11 [2018-01-31 08:40:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14110 backedges. 4258 proven. 445 refuted. 0 times theorem prover too weak. 9407 trivial. 0 not checked. [2018-01-31 08:40:58,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:40:58,326 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:40:58,333 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:40:58,446 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:40:58,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:40:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14110 backedges. 7328 proven. 268 refuted. 0 times theorem prover too weak. 6514 trivial. 0 not checked. [2018-01-31 08:40:59,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:40:59,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 36] total 61 [2018-01-31 08:40:59,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-31 08:40:59,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-31 08:40:59,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=3382, Unknown=0, NotChecked=0, Total=3660 [2018-01-31 08:40:59,295 INFO L87 Difference]: Start difference. First operand 839 states and 855 transitions. Second operand 61 states. [2018-01-31 08:41:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:02,555 INFO L93 Difference]: Finished difference Result 1211 states and 1244 transitions. [2018-01-31 08:41:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-31 08:41:02,556 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 660 [2018-01-31 08:41:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:02,558 INFO L225 Difference]: With dead ends: 1211 [2018-01-31 08:41:02,558 INFO L226 Difference]: Without dead ends: 968 [2018-01-31 08:41:02,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1408, Invalid=13598, Unknown=0, NotChecked=0, Total=15006 [2018-01-31 08:41:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-01-31 08:41:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 858. [2018-01-31 08:41:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-01-31 08:41:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 873 transitions. [2018-01-31 08:41:02,616 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 873 transitions. Word has length 660 [2018-01-31 08:41:02,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:02,616 INFO L432 AbstractCegarLoop]: Abstraction has 858 states and 873 transitions. [2018-01-31 08:41:02,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-01-31 08:41:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 873 transitions. [2018-01-31 08:41:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2018-01-31 08:41:02,622 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:02,622 INFO L351 BasicCegarLoop]: trace histogram [64, 56, 56, 55, 55, 55, 55, 55, 55, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:02,622 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash -532715854, now seen corresponding path program 11 times [2018-01-31 08:41:02,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:02,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:02,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:02,624 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:02,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:02,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 15113 backedges. 4836 proven. 334 refuted. 0 times theorem prover too weak. 9943 trivial. 0 not checked. [2018-01-31 08:41:04,885 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:04,885 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:41:04,890 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:41:04,916 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:04,925 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:04,937 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:04,950 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:04,964 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:04,978 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:04,992 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:05,006 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:05,020 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:05,034 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:05,048 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:05,065 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:05,067 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:05,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15113 backedges. 5106 proven. 1446 refuted. 0 times theorem prover too weak. 8561 trivial. 0 not checked. [2018-01-31 08:41:06,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:06,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 51] total 76 [2018-01-31 08:41:06,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-01-31 08:41:06,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-01-31 08:41:06,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=5157, Unknown=0, NotChecked=0, Total=5700 [2018-01-31 08:41:06,681 INFO L87 Difference]: Start difference. First operand 858 states and 873 transitions. Second operand 76 states. [2018-01-31 08:41:09,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:09,784 INFO L93 Difference]: Finished difference Result 1266 states and 1293 transitions. [2018-01-31 08:41:09,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-01-31 08:41:09,784 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 678 [2018-01-31 08:41:09,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:09,788 INFO L225 Difference]: With dead ends: 1266 [2018-01-31 08:41:09,788 INFO L226 Difference]: Without dead ends: 909 [2018-01-31 08:41:09,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7365 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2392, Invalid=18778, Unknown=0, NotChecked=0, Total=21170 [2018-01-31 08:41:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-01-31 08:41:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 874. [2018-01-31 08:41:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-01-31 08:41:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 887 transitions. [2018-01-31 08:41:09,849 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 887 transitions. Word has length 678 [2018-01-31 08:41:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:09,851 INFO L432 AbstractCegarLoop]: Abstraction has 874 states and 887 transitions. [2018-01-31 08:41:09,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-01-31 08:41:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 887 transitions. [2018-01-31 08:41:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-01-31 08:41:09,860 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:09,861 INFO L351 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 64, 64, 64, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:09,861 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:09,861 INFO L82 PathProgramCache]: Analyzing trace with hash -401975728, now seen corresponding path program 10 times [2018-01-31 08:41:09,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:09,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:09,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:09,862 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:09,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:09,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20307 backedges. 8827 proven. 1370 refuted. 0 times theorem prover too weak. 10110 trivial. 0 not checked. [2018-01-31 08:41:12,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:12,534 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:12,539 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:41:12,662 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:12,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 20307 backedges. 9923 proven. 342 refuted. 0 times theorem prover too weak. 10042 trivial. 0 not checked. [2018-01-31 08:41:13,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:13,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 75 [2018-01-31 08:41:13,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-01-31 08:41:13,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-01-31 08:41:13,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=5024, Unknown=0, NotChecked=0, Total=5550 [2018-01-31 08:41:13,783 INFO L87 Difference]: Start difference. First operand 874 states and 887 transitions. Second operand 75 states. [2018-01-31 08:41:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:17,675 INFO L93 Difference]: Finished difference Result 1266 states and 1284 transitions. [2018-01-31 08:41:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-01-31 08:41:17,675 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 778 [2018-01-31 08:41:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:17,678 INFO L225 Difference]: With dead ends: 1266 [2018-01-31 08:41:17,678 INFO L226 Difference]: Without dead ends: 1134 [2018-01-31 08:41:17,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11293 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3971, Invalid=29701, Unknown=0, NotChecked=0, Total=33672 [2018-01-31 08:41:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2018-01-31 08:41:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 874. [2018-01-31 08:41:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-01-31 08:41:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 885 transitions. [2018-01-31 08:41:17,735 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 885 transitions. Word has length 778 [2018-01-31 08:41:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:17,736 INFO L432 AbstractCegarLoop]: Abstraction has 874 states and 885 transitions. [2018-01-31 08:41:17,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-01-31 08:41:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 885 transitions. [2018-01-31 08:41:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2018-01-31 08:41:17,743 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:17,743 INFO L351 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 65, 65, 65, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:17,743 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash 204552207, now seen corresponding path program 11 times [2018-01-31 08:41:17,744 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:17,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:17,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:17,745 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:17,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:17,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20904 backedges. 9239 proven. 1555 refuted. 0 times theorem prover too weak. 10110 trivial. 0 not checked. [2018-01-31 08:41:20,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:20,165 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:41:20,170 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:41:20,206 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,219 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,233 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,247 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,262 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,277 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,293 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,309 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,325 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,341 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,358 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,380 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:41:20,383 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:20,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:41:21,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20904 backedges. 6104 proven. 1738 refuted. 0 times theorem prover too weak. 13062 trivial. 0 not checked. [2018-01-31 08:41:21,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:41:21,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 53] total 88 [2018-01-31 08:41:21,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-01-31 08:41:21,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-01-31 08:41:21,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=7058, Unknown=0, NotChecked=0, Total=7656 [2018-01-31 08:41:21,952 INFO L87 Difference]: Start difference. First operand 874 states and 885 transitions. Second operand 88 states. [2018-01-31 08:41:25,930 WARN L146 SmtUtils]: Spent 536ms on a formula simplification. DAG size of input: 32 DAG size of output 22 [2018-01-31 08:41:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:41:29,422 INFO L93 Difference]: Finished difference Result 1158 states and 1174 transitions. [2018-01-31 08:41:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-01-31 08:41:29,422 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 787 [2018-01-31 08:41:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:41:29,425 INFO L225 Difference]: With dead ends: 1158 [2018-01-31 08:41:29,425 INFO L226 Difference]: Without dead ends: 1035 [2018-01-31 08:41:29,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18554 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6264, Invalid=50142, Unknown=0, NotChecked=0, Total=56406 [2018-01-31 08:41:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-01-31 08:41:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 999. [2018-01-31 08:41:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 999 states. [2018-01-31 08:41:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1011 transitions. [2018-01-31 08:41:29,479 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1011 transitions. Word has length 787 [2018-01-31 08:41:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:41:29,479 INFO L432 AbstractCegarLoop]: Abstraction has 999 states and 1011 transitions. [2018-01-31 08:41:29,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-01-31 08:41:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1011 transitions. [2018-01-31 08:41:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2018-01-31 08:41:29,492 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:41:29,493 INFO L351 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 76, 76, 76, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:41:29,493 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 08:41:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1845922883, now seen corresponding path program 12 times [2018-01-31 08:41:29,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:41:29,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:41:29,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:29,495 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:41:29,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:41:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:41:29,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:41:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28408 backedges. 11589 proven. 1749 refuted. 0 times theorem prover too weak. 15070 trivial. 0 not checked. [2018-01-31 08:41:32,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:41:32,626 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:41:32,632 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:41:32,667 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,672 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,676 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,678 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,684 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,695 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,704 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,718 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,730 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,745 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,762 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,786 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,808 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,840 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,935 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:41:32,939 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:41:32,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-01-31 08:41:32,984 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:41:32,984 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:41:32,989 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:41:32,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:41:32 BoogieIcfgContainer [2018-01-31 08:41:32,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:41:32,990 INFO L168 Benchmark]: Toolchain (without parser) took 121260.50 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.4 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 409.7 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:32,992 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:41:32,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.89 ms. Allocated memory is still 305.7 MB. Free memory was 263.4 MB in the beginning and 255.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:32,996 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 305.7 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:32,997 INFO L168 Benchmark]: RCFGBuilder took 533.24 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 236.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:32,997 INFO L168 Benchmark]: TraceAbstraction took 120420.72 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 236.4 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 381.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:41:32,999 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.20 ms. Allocated memory is still 305.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.89 ms. Allocated memory is still 305.7 MB. Free memory was 263.4 MB in the beginning and 255.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 305.7 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 533.24 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 236.4 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 120420.72 ms. Allocated memory was 305.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 236.4 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 381.8 MB. Max. memory is 5.3 GB. * 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 907 with TraceHistMax 87, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - 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 907 with TraceHistMax 87, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 907 with TraceHistMax 87, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - 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 907 with TraceHistMax 87, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 907 with TraceHistMax 87, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - 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 907 with TraceHistMax 87, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 120.3s OverallTime, 37 OverallIterations, 87 TraceHistogramMax, 56.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2042 SDtfs, 16594 SDslu, 25754 SDs, 0 SdLazy, 30650 SolverSat, 2741 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11354 GetRequests, 8959 SyntacticMatches, 69 SemanticMatches, 2326 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94561 ImplicationChecksByTransitivity, 69.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=999occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 1633 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 50.9s InterpolantComputationTime, 19081 NumberOfCodeBlocks, 18482 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 19013 ConstructedInterpolants, 1446 QuantifiedInterpolants, 31097374 SizeOfPredicates, 524 NumberOfNonLiveVariables, 16590 ConjunctsInSsa, 766 ConjunctsInUnsatCore, 68 InterpolantComputations, 7 PerfectInterpolantSequences, 269693/285590 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-41-33-016.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-41-33-016.csv Completed graceful shutdown