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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:17:15,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:17:15,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:17:15,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:17:15,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:17:15,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:17:15,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:17:15,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:17:15,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:17:15,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:17:15,676 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:17:15,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:17:15,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:17:15,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:17:15,678 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:17:15,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:17:15,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:17:15,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:17:15,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:17:15,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:17:15,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:17:15,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:17:15,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:17:15,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:17:15,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:17:15,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:17:15,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:17:15,690 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:17:15,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:17:15,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:17:15,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:17:15,691 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:17:15,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:17:15,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:17:15,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:17:15,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:17:15,702 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:17:15,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:17:15,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:17:15,703 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:17:15,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:17:15,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:17:15,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:17:15,704 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:17:15,704 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:17:15,704 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:17:15,704 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:17:15,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:17:15,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:17:15,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:17:15,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:17:15,705 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:17:15,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:17:15,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:17:15,705 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:17:15,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:17:15,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:17:15,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:17:15,749 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:17:15,753 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:17:15,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:17:15,756 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:17:15,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-02 09:17:15,870 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:17:15,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:17:15,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:17:15,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:17:15,875 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:17:15,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:17:15" (1/1) ... [2018-02-02 09:17:15,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379f4a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:15, skipping insertion in model container [2018-02-02 09:17:15,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:17:15" (1/1) ... [2018-02-02 09:17:15,888 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:17:15,899 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:17:15,982 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:17:15,996 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:17:16,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16 WrapperNode [2018-02-02 09:17:16,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:17:16,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:17:16,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:17:16,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:17:16,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... [2018-02-02 09:17:16,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:17:16,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:17:16,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:17:16,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:17:16,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 09:17:16,084 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:17:16,084 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:17:16,084 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-02-02 09:17:16,084 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 09:17:16,085 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:17:16,085 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:17:16,085 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:17:16,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:17:16,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:17:16,085 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:17:16,085 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-02-02 09:17:16,086 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 09:17:16,086 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:17:16,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:17:16,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:17:16,263 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:17:16,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:17:16 BoogieIcfgContainer [2018-02-02 09:17:16,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:17:16,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:17:16,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:17:16,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:17:16,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:17:15" (1/3) ... [2018-02-02 09:17:16,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5d35a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:17:16, skipping insertion in model container [2018-02-02 09:17:16,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:17:16" (2/3) ... [2018-02-02 09:17:16,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5d35a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:17:16, skipping insertion in model container [2018-02-02 09:17:16,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:17:16" (3/3) ... [2018-02-02 09:17:16,269 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-02 09:17:16,275 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:17:16,281 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-02 09:17:16,308 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:17:16,309 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:17:16,309 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:17:16,309 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:17:16,309 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:17:16,309 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:17:16,309 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:17:16,309 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:17:16,310 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:17:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-02-02 09:17:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:17:16,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:16,326 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:16,326 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-02-02 09:17:16,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:16,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:16,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:16,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:16,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:16,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:16,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:17:16,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 09:17:16,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 09:17:16,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:17:16,437 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-02-02 09:17:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:16,450 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-02 09:17:16,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 09:17:16,452 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 09:17:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:16,461 INFO L225 Difference]: With dead ends: 68 [2018-02-02 09:17:16,461 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 09:17:16,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:17:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 09:17:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-02 09:17:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 09:17:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-02 09:17:16,490 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-02-02 09:17:16,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:16,491 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-02 09:17:16,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 09:17:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-02 09:17:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:17:16,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:16,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:16,492 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-02-02 09:17:16,494 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:16,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:16,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:16,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:16,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:16,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:16,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:17:16,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:17:16,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:17:16,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:17:16,611 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-02-02 09:17:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:16,665 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-02 09:17:16,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:17:16,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-02 09:17:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:16,669 INFO L225 Difference]: With dead ends: 71 [2018-02-02 09:17:16,669 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 09:17:16,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:17:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 09:17:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-02-02 09:17:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 09:17:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-02 09:17:16,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-02-02 09:17:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:16,679 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-02 09:17:16,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:17:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-02 09:17:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:17:16,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:16,680 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:16,680 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-02-02 09:17:16,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:16,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:16,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:16,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:16,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:16,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:16,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:17:16,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:17:16,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:17:16,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:17:16,757 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-02 09:17:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:16,841 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-02 09:17:16,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:17:16,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-02 09:17:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:16,843 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:17:16,843 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:17:16,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:17:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:17:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-02-02 09:17:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 09:17:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-02 09:17:16,849 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-02-02 09:17:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:16,850 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-02 09:17:16,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:17:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-02 09:17:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:17:16,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:16,851 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] [2018-02-02 09:17:16,851 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-02-02 09:17:16,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:16,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:16,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:16,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:16,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:16,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:16,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:17:16,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:17:16,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:17:16,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:17:16,896 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-02 09:17:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:16,955 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-02 09:17:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:17:16,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 09:17:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:16,958 INFO L225 Difference]: With dead ends: 77 [2018-02-02 09:17:16,958 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 09:17:16,958 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-02-02 09:17:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 09:17:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 09:17:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 09:17:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 09:17:16,965 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-02-02 09:17:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:16,966 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 09:17:16,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:17:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 09:17:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:17:16,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:16,967 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] [2018-02-02 09:17:16,967 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-02-02 09:17:16,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:16,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:16,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:16,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:16,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:17,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:17,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:17:17,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:17:17,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:17:17,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:17:17,034 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-02-02 09:17:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:17,137 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-02 09:17:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:17:17,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 09:17:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:17,138 INFO L225 Difference]: With dead ends: 89 [2018-02-02 09:17:17,138 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 09:17:17,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:17:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 09:17:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-02-02 09:17:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 09:17:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-02 09:17:17,144 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-02-02 09:17:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:17,144 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-02 09:17:17,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:17:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-02 09:17:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:17:17,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:17,145 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:17,145 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-02-02 09:17:17,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:17,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:17,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:17,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:17,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:17,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:17,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:17:17,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:17:17,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:17:17,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:17:17,198 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-02-02 09:17:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:17,229 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-02 09:17:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:17:17,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 09:17:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:17,231 INFO L225 Difference]: With dead ends: 91 [2018-02-02 09:17:17,231 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 09:17:17,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-02 09:17:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 09:17:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-02 09:17:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 09:17:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-02 09:17:17,237 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-02-02 09:17:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:17,239 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-02 09:17:17,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:17:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-02 09:17:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:17:17,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:17,240 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:17,240 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-02-02 09:17:17,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:17,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:17,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:17,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:17,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:17,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:17,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:17:17,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:17:17,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:17:17,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:17:17,340 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-02-02 09:17:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:17,441 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-02 09:17:17,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:17:17,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 09:17:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:17,442 INFO L225 Difference]: With dead ends: 86 [2018-02-02 09:17:17,442 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 09:17:17,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:17:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 09:17:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-02 09:17:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 09:17:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-02 09:17:17,447 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-02-02 09:17:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:17,448 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-02 09:17:17,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:17:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-02 09:17:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:17:17,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:17,451 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:17,452 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-02-02 09:17:17,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:17,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:17,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:17,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:17,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:17,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:17,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:17:17,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:17:17,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:17:17,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:17:17,558 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-02-02 09:17:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:17,780 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-02 09:17:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:17:17,781 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 09:17:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:17,782 INFO L225 Difference]: With dead ends: 101 [2018-02-02 09:17:17,782 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 09:17:17,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:17:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 09:17:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-02-02 09:17:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 09:17:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-02-02 09:17:17,790 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-02-02 09:17:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:17,790 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-02-02 09:17:17,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:17:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-02-02 09:17:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:17:17,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:17,791 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:17,791 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-02-02 09:17:17,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:17,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:17,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:17,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:17,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:17,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:17,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:17:17,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:17:17,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:17:17,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:17:17,895 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-02-02 09:17:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:17,987 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-02-02 09:17:17,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:17:17,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-02 09:17:17,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:17,989 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:17:17,989 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:17:17,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:17:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:17:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-02 09:17:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 09:17:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 09:17:17,994 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-02-02 09:17:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:17,994 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 09:17:17,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:17:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 09:17:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:17:17,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:17,995 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:17,995 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-02-02 09:17:17,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:17,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:17,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:17,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:17,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:18,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:18,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:18,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:18,194 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:18,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:18,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:18,268 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-02-02 09:17:18,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,274 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-02-02 09:17:18,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 09:17:18,304 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-02 09:17:18,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-02 09:17:18,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,325 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 8 treesize of output 7 [2018-02-02 09:17:18,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:18,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-02 09:17:18,381 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (= (* 4 v_prenex_2) (select |c_#length| v_prenex_1)))) is different from true [2018-02-02 09:17:18,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:18,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:18,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:18,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,414 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 14 treesize of output 17 [2018-02-02 09:17:18,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:18,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-02-02 09:17:18,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:18,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-02 09:17:18,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 09:17:18,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:18,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:18,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:18,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:18,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 09:17:18,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-02-02 09:17:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-02 09:17:18,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:18,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-02 09:17:18,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:17:18,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:17:18,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=322, Unknown=2, NotChecked=74, Total=462 [2018-02-02 09:17:18,687 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 22 states. [2018-02-02 09:17:20,215 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |foo_~#a~0.base|)))) is different from true [2018-02-02 09:17:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:20,527 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2018-02-02 09:17:20,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 09:17:20,528 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-02-02 09:17:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:20,529 INFO L225 Difference]: With dead ends: 234 [2018-02-02 09:17:20,529 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 09:17:20,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=379, Invalid=2071, Unknown=12, NotChecked=294, Total=2756 [2018-02-02 09:17:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 09:17:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2018-02-02 09:17:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:17:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2018-02-02 09:17:20,537 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 42 [2018-02-02 09:17:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:20,537 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-02-02 09:17:20,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:17:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2018-02-02 09:17:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 09:17:20,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:20,538 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:20,538 INFO L371 AbstractCegarLoop]: === Iteration 11 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:20,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-02-02 09:17:20,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:20,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:20,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:20,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:20,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:20,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 09:17:20,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:20,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:17:20,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:17:20,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:17:20,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:17:20,628 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand 8 states. [2018-02-02 09:17:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:20,721 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2018-02-02 09:17:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:17:20,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-02-02 09:17:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:20,722 INFO L225 Difference]: With dead ends: 177 [2018-02-02 09:17:20,722 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 09:17:20,722 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:17:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 09:17:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-02 09:17:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 09:17:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2018-02-02 09:17:20,729 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 43 [2018-02-02 09:17:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:20,729 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2018-02-02 09:17:20,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:17:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2018-02-02 09:17:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 09:17:20,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:20,731 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:20,731 INFO L371 AbstractCegarLoop]: === Iteration 12 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-02-02 09:17:20,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:20,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:20,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:20,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:20,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:20,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:20,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:20,784 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:20,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:20,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:17:20,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:17:20,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-02-02 09:17:20,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:17:20,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:17:20,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:17:20,862 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 9 states. [2018-02-02 09:17:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:20,940 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-02-02 09:17:20,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:17:20,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-02 09:17:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:20,941 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:17:20,941 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:17:20,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:17:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:17:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-02-02 09:17:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 09:17:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-02 09:17:20,945 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 46 [2018-02-02 09:17:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:20,945 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-02 09:17:20,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:17:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-02 09:17:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:17:20,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:20,946 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:20,946 INFO L371 AbstractCegarLoop]: === Iteration 13 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:20,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-02-02 09:17:20,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:20,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:20,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:20,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:20,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:20,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:17:21,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:17:21,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:17:21,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:17:21,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:17:21,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:17:21,034 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 8 states. [2018-02-02 09:17:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:21,145 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-02-02 09:17:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:17:21,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-02-02 09:17:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:21,146 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:17:21,147 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:17:21,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:17:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:17:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2018-02-02 09:17:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:17:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-02-02 09:17:21,150 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-02-02 09:17:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:21,150 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-02-02 09:17:21,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:17:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-02-02 09:17:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 09:17:21,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:21,151 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:21,151 INFO L371 AbstractCegarLoop]: === Iteration 14 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-02-02 09:17:21,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:21,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:21,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:21,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:21,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:21,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:17:21,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:21,260 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:17:21,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:21,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:17:21,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:21,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-02-02 09:17:21,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:17:21,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:17:21,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:17:21,366 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 15 states. [2018-02-02 09:17:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:21,513 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-02 09:17:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:17:21,513 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-02 09:17:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:21,514 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:17:21,514 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:17:21,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:17:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:17:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-02-02 09:17:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 09:17:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-02-02 09:17:21,516 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-02-02 09:17:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:21,516 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-02-02 09:17:21,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:17:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-02-02 09:17:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 09:17:21,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:21,517 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:21,517 INFO L371 AbstractCegarLoop]: === Iteration 15 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-02-02 09:17:21,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:21,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:21,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:21,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:21,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:21,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 09:17:21,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:21,647 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:21,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:21,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 09:17:21,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:17:21,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2018-02-02 09:17:21,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:17:21,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:17:21,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:17:21,768 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 14 states. [2018-02-02 09:17:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:22,021 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 09:17:22,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:17:22,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-02 09:17:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:22,022 INFO L225 Difference]: With dead ends: 146 [2018-02-02 09:17:22,023 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 09:17:22,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:17:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 09:17:22,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-02-02 09:17:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 09:17:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-02 09:17:22,026 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-02-02 09:17:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:22,027 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-02 09:17:22,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:17:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-02 09:17:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:17:22,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:22,028 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:22,028 INFO L371 AbstractCegarLoop]: === Iteration 16 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:22,028 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-02-02 09:17:22,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:22,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:22,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:22,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:22,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:22,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 09:17:22,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:22,215 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:22,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:22,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:22,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:17:22,297 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 8 treesize of output 7 [2018-02-02 09:17:22,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:22,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:17:22,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:17:22,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-02 09:17:22,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-02-02 09:17:22,458 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 17 treesize of output 16 [2018-02-02 09:17:22,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:22,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:17:22,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:22,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-02-02 09:17:22,570 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int)) (and (= (select (select |c_#memory_int| |foo_~#a~0.base|) 0) |c_foo_#t~ret5|) (= (store |c_old(#memory_int)| |foo_~#a~0.base| (store (select |c_old(#memory_int)| |foo_~#a~0.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|))) |c_#memory_int|))) is different from true [2018-02-02 09:17:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-02-02 09:17:24,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:24,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-02-02 09:17:24,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:17:24,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:17:24,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=938, Unknown=16, NotChecked=62, Total=1122 [2018-02-02 09:17:24,654 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 34 states. [2018-02-02 09:17:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:28,065 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2018-02-02 09:17:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 09:17:28,065 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-02-02 09:17:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:28,067 INFO L225 Difference]: With dead ends: 191 [2018-02-02 09:17:28,067 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 09:17:28,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=413, Invalid=3325, Unknown=48, NotChecked=120, Total=3906 [2018-02-02 09:17:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 09:17:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 139. [2018-02-02 09:17:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 09:17:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-02-02 09:17:28,073 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 67 [2018-02-02 09:17:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:28,073 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-02-02 09:17:28,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:17:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-02-02 09:17:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 09:17:28,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:28,074 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 09:17:28,074 INFO L371 AbstractCegarLoop]: === Iteration 17 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2066805359, now seen corresponding path program 1 times [2018-02-02 09:17:28,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:28,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:28,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:28,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:28,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:28,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 09:17:28,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:28,188 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:28,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:28,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:28,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:28,294 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 19 treesize of output 22 [2018-02-02 09:17:28,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:28,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:28,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:28,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:28,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:28,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:28,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28 [2018-02-02 09:17:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 09:17:28,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:28,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-02 09:17:28,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:17:28,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:17:28,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:17:28,393 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 19 states. [2018-02-02 09:17:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:28,756 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-02-02 09:17:28,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:17:28,756 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-02-02 09:17:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:28,757 INFO L225 Difference]: With dead ends: 143 [2018-02-02 09:17:28,757 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 09:17:28,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:17:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 09:17:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-02-02 09:17:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 09:17:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-02-02 09:17:28,761 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 78 [2018-02-02 09:17:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:28,761 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-02-02 09:17:28,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:17:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-02-02 09:17:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 09:17:28,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:28,762 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:28,762 INFO L371 AbstractCegarLoop]: === Iteration 18 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:28,763 INFO L82 PathProgramCache]: Analyzing trace with hash -864143526, now seen corresponding path program 1 times [2018-02-02 09:17:28,763 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:28,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:28,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:28,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:28,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:28,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 09:17:28,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:28,818 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:28,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:28,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-02-02 09:17:28,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:28,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-02 09:17:28,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:17:28,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:17:28,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:17:28,903 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 6 states. [2018-02-02 09:17:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:28,928 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 09:17:28,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:17:28,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-02-02 09:17:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:28,929 INFO L225 Difference]: With dead ends: 145 [2018-02-02 09:17:28,929 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 09:17:28,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:17:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 09:17:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-02-02 09:17:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 09:17:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-02-02 09:17:28,931 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 80 [2018-02-02 09:17:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:28,931 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-02-02 09:17:28,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:17:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-02-02 09:17:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:17:28,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:28,932 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:28,932 INFO L371 AbstractCegarLoop]: === Iteration 19 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -999779067, now seen corresponding path program 2 times [2018-02-02 09:17:28,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:28,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:28,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:28,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:28,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:28,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-02-02 09:17:29,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:29,128 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:29,133 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:17:29,144 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:29,152 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:29,155 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:29,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:29,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:29,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:29,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:29,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:29,232 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 19 treesize of output 22 [2018-02-02 09:17:29,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:29,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:29,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:30 [2018-02-02 09:17:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-02-02 09:17:29,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:29,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-02-02 09:17:29,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:17:29,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:17:29,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:17:29,355 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 22 states. [2018-02-02 09:17:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:29,854 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-02-02 09:17:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:17:29,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-02-02 09:17:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:29,855 INFO L225 Difference]: With dead ends: 141 [2018-02-02 09:17:29,855 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 09:17:29,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:17:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 09:17:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-02-02 09:17:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 09:17:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2018-02-02 09:17:29,857 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 84 [2018-02-02 09:17:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:29,857 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2018-02-02 09:17:29,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:17:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2018-02-02 09:17:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:17:29,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:29,858 INFO L351 BasicCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:29,858 INFO L371 AbstractCegarLoop]: === Iteration 20 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash 311899052, now seen corresponding path program 2 times [2018-02-02 09:17:29,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:29,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:29,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:29,859 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:29,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:29,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 09:17:29,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:29,959 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:29,963 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:17:29,972 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:29,980 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:29,982 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:29,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-02 09:17:30,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:30,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-02-02 09:17:30,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:17:30,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:17:30,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:17:30,068 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 17 states. [2018-02-02 09:17:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:30,367 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 09:17:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:17:30,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-02-02 09:17:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:30,368 INFO L225 Difference]: With dead ends: 148 [2018-02-02 09:17:30,368 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 09:17:30,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:17:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 09:17:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2018-02-02 09:17:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 09:17:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-02-02 09:17:30,370 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 93 [2018-02-02 09:17:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:30,370 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-02-02 09:17:30,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:17:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-02-02 09:17:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 09:17:30,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:30,371 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:30,371 INFO L371 AbstractCegarLoop]: === Iteration 21 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash -52037211, now seen corresponding path program 2 times [2018-02-02 09:17:30,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:30,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:30,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:30,372 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:30,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:30,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 9 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 09:17:30,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:30,535 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:30,540 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:17:30,556 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:30,571 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:30,574 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:30,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 09:17:30,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:30,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-02 09:17:30,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:17:30,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:17:30,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:17:30,669 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 19 states. [2018-02-02 09:17:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:31,002 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-02-02 09:17:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:17:31,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-02-02 09:17:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:31,003 INFO L225 Difference]: With dead ends: 164 [2018-02-02 09:17:31,003 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:17:31,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:17:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:17:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-02-02 09:17:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:17:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-02 09:17:31,009 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 109 [2018-02-02 09:17:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:31,009 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-02 09:17:31,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:17:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-02 09:17:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 09:17:31,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:31,010 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:31,010 INFO L371 AbstractCegarLoop]: === Iteration 22 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1577506560, now seen corresponding path program 3 times [2018-02-02 09:17:31,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:31,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:31,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:31,012 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:31,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:31,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 25 proven. 53 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 09:17:31,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:31,413 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:31,418 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:17:31,430 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:31,437 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:31,447 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:31,450 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:31,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:31,455 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-02-02 09:17:31,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,475 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-02-02 09:17:31,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 09:17:31,493 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) is different from true [2018-02-02 09:17:31,496 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 8 treesize of output 7 [2018-02-02 09:17:31,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-02 09:17:31,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:31,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-02 09:17:31,958 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (= (* 4 v_prenex_8) (select |c_#length| v_prenex_7)))) is different from true [2018-02-02 09:17:31,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:31,967 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 14 treesize of output 17 [2018-02-02 09:17:31,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:31,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:31,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:31,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:31,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:31,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-02-02 09:17:32,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-02 09:17:32,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:32,048 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 8 treesize of output 7 [2018-02-02 09:17:32,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:32,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:32,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-02 09:17:32,055 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (= (* 4 v_prenex_10) (select |c_#length| v_prenex_9)))) is different from true [2018-02-02 09:17:32,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:32,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-02 09:17:32,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 09:17:32,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:32,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:32,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:32,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:32,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-02-02 09:17:32,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:45, output treesize:66 [2018-02-02 09:17:32,298 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 8 treesize of output 7 [2018-02-02 09:17:32,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:32,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-02-02 09:17:32,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:32,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:17:32,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-02 09:17:32,360 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|foo_~#a~0.base| Int) (foo_~n Int)) (and (= (store |c_old(#length)| |foo_~#a~0.base| (* 4 foo_~n)) |c_#length|) (= (select |c_old(#valid)| |foo_~#a~0.base|) 0))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (= (* 4 v_prenex_18) (select |c_#length| v_prenex_17)))) is different from true [2018-02-02 09:17:32,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:32,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-02 09:17:32,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 09:17:32,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:32,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:17:32,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 09:17:32,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:17:32,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2018-02-02 09:17:32,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:60, output treesize:96 [2018-02-02 09:17:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 44 not checked. [2018-02-02 09:17:32,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:32,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 33 [2018-02-02 09:17:32,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:17:32,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:17:32,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=735, Unknown=7, NotChecked=236, Total=1122 [2018-02-02 09:17:32,534 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 34 states. [2018-02-02 09:17:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:33,160 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-02-02 09:17:33,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:17:33,160 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 114 [2018-02-02 09:17:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:33,161 INFO L225 Difference]: With dead ends: 134 [2018-02-02 09:17:33,161 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 09:17:33,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=281, Invalid=1450, Unknown=7, NotChecked=332, Total=2070 [2018-02-02 09:17:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 09:17:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 09:17:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 09:17:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-02-02 09:17:33,164 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 114 [2018-02-02 09:17:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:33,164 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-02-02 09:17:33,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:17:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-02-02 09:17:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 09:17:33,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:33,165 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:33,165 INFO L371 AbstractCegarLoop]: === Iteration 23 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash -308556470, now seen corresponding path program 1 times [2018-02-02 09:17:33,165 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:33,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:33,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:33,165 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:33,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:33,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-02 09:17:33,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:33,212 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:33,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:33,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-02 09:17:33,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:33,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-02 09:17:33,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:17:33,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:17:33,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:17:33,305 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 7 states. [2018-02-02 09:17:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:33,350 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 09:17:33,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:17:33,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-02-02 09:17:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:33,352 INFO L225 Difference]: With dead ends: 146 [2018-02-02 09:17:33,352 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 09:17:33,352 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:17:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 09:17:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2018-02-02 09:17:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 09:17:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-02-02 09:17:33,356 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 122 [2018-02-02 09:17:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:33,356 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-02-02 09:17:33,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:17:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-02-02 09:17:33,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-02 09:17:33,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:33,357 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:33,358 INFO L371 AbstractCegarLoop]: === Iteration 24 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -974589226, now seen corresponding path program 2 times [2018-02-02 09:17:33,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:33,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:33,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:33,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:33,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:33,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-02-02 09:17:33,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:33,448 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:33,456 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:17:33,472 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:33,506 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:33,513 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:33,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 133 proven. 10 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-02-02 09:17:33,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:33,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-02-02 09:17:33,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:17:33,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:17:33,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:17:33,650 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 16 states. [2018-02-02 09:17:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:33,828 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-02-02 09:17:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:17:33,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2018-02-02 09:17:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:33,829 INFO L225 Difference]: With dead ends: 208 [2018-02-02 09:17:33,829 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 09:17:33,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:17:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 09:17:33,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2018-02-02 09:17:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 09:17:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2018-02-02 09:17:33,834 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 169 [2018-02-02 09:17:33,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:33,835 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2018-02-02 09:17:33,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:17:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2018-02-02 09:17:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-02 09:17:33,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:33,837 INFO L351 BasicCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 9, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:33,837 INFO L371 AbstractCegarLoop]: === Iteration 25 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1271505270, now seen corresponding path program 3 times [2018-02-02 09:17:33,838 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:33,838 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:33,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:33,839 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:33,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:33,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-02-02 09:17:34,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:34,037 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:34,044 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:17:34,066 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:34,073 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:34,075 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:34,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2018-02-02 09:17:34,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:17:34,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2018-02-02 09:17:34,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:17:34,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:17:34,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:17:34,153 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand 11 states. [2018-02-02 09:17:34,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:34,257 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2018-02-02 09:17:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:17:34,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2018-02-02 09:17:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:34,258 INFO L225 Difference]: With dead ends: 191 [2018-02-02 09:17:34,258 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 09:17:34,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:17:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 09:17:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-02-02 09:17:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 09:17:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2018-02-02 09:17:34,263 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 228 [2018-02-02 09:17:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:34,263 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2018-02-02 09:17:34,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:17:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-02-02 09:17:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-02-02 09:17:34,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:34,265 INFO L351 BasicCegarLoop]: trace histogram [18, 15, 12, 12, 12, 12, 12, 9, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:34,265 INFO L371 AbstractCegarLoop]: === Iteration 26 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1986892732, now seen corresponding path program 1 times [2018-02-02 09:17:34,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:34,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:34,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:34,266 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:34,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:34,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2018-02-02 09:17:34,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:34,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:34,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:34,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 844 proven. 9 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2018-02-02 09:17:34,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:34,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-02-02 09:17:34,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:17:34,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:17:34,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:17:34,699 INFO L87 Difference]: Start difference. First operand 183 states and 193 transitions. Second operand 19 states. [2018-02-02 09:17:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:34,930 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-02-02 09:17:34,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:17:34,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 286 [2018-02-02 09:17:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:34,931 INFO L225 Difference]: With dead ends: 223 [2018-02-02 09:17:34,931 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 09:17:34,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:17:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 09:17:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2018-02-02 09:17:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 09:17:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2018-02-02 09:17:34,936 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 286 [2018-02-02 09:17:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:34,936 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2018-02-02 09:17:34,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:17:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2018-02-02 09:17:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-02 09:17:34,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:34,938 INFO L351 BasicCegarLoop]: trace histogram [22, 22, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:34,938 INFO L371 AbstractCegarLoop]: === Iteration 27 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1059600550, now seen corresponding path program 2 times [2018-02-02 09:17:34,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:34,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:34,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:34,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:34,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:34,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1933 trivial. 0 not checked. [2018-02-02 09:17:35,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:35,195 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:35,199 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:17:35,215 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:35,252 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:35,260 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:35,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 1284 proven. 24 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2018-02-02 09:17:35,376 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:35,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-02 09:17:35,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:17:35,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:17:35,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:17:35,376 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand 21 states. [2018-02-02 09:17:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:35,613 INFO L93 Difference]: Finished difference Result 305 states and 332 transitions. [2018-02-02 09:17:35,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:17:35,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 359 [2018-02-02 09:17:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:35,615 INFO L225 Difference]: With dead ends: 305 [2018-02-02 09:17:35,615 INFO L226 Difference]: Without dead ends: 305 [2018-02-02 09:17:35,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:17:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-02 09:17:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-02-02 09:17:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 09:17:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-02 09:17:35,622 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 359 [2018-02-02 09:17:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:35,622 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-02 09:17:35,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:17:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-02 09:17:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-02 09:17:35,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:35,624 INFO L351 BasicCegarLoop]: trace histogram [30, 26, 22, 22, 22, 22, 22, 18, 18, 18, 18, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:35,624 INFO L371 AbstractCegarLoop]: === Iteration 28 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1405874031, now seen corresponding path program 3 times [2018-02-02 09:17:35,624 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:35,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:35,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:35,625 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:35,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:35,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 3271 trivial. 0 not checked. [2018-02-02 09:17:35,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:35,974 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:35,981 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:17:36,011 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:36,017 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:36,024 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:36,035 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:36,063 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:36,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:36,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3483 backedges. 993 proven. 21 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2018-02-02 09:17:36,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:36,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-02 09:17:36,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:17:36,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:17:36,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:17:36,326 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 20 states. [2018-02-02 09:17:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:36,702 INFO L93 Difference]: Finished difference Result 349 states and 389 transitions. [2018-02-02 09:17:36,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:17:36,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 441 [2018-02-02 09:17:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:36,704 INFO L225 Difference]: With dead ends: 349 [2018-02-02 09:17:36,704 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 09:17:36,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:17:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 09:17:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 266. [2018-02-02 09:17:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-02 09:17:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 289 transitions. [2018-02-02 09:17:36,709 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 289 transitions. Word has length 441 [2018-02-02 09:17:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:36,710 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 289 transitions. [2018-02-02 09:17:36,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:17:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 289 transitions. [2018-02-02 09:17:36,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-02-02 09:17:36,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:36,712 INFO L351 BasicCegarLoop]: trace histogram [35, 35, 26, 26, 26, 26, 26, 26, 26, 26, 26, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:36,712 INFO L371 AbstractCegarLoop]: === Iteration 29 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1260936207, now seen corresponding path program 4 times [2018-02-02 09:17:36,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:36,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:36,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:36,713 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:36,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:36,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 5131 trivial. 0 not checked. [2018-02-02 09:17:37,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:37,164 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:37,169 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 09:17:37,308 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:37,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5401 backedges. 3198 proven. 44 refuted. 0 times theorem prover too weak. 2159 trivial. 0 not checked. [2018-02-02 09:17:37,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:37,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-02 09:17:37,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:17:37,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:17:37,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:17:37,618 INFO L87 Difference]: Start difference. First operand 266 states and 289 transitions. Second operand 25 states. [2018-02-02 09:17:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:38,048 INFO L93 Difference]: Finished difference Result 602 states and 697 transitions. [2018-02-02 09:17:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:17:38,048 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 530 [2018-02-02 09:17:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:38,051 INFO L225 Difference]: With dead ends: 602 [2018-02-02 09:17:38,051 INFO L226 Difference]: Without dead ends: 602 [2018-02-02 09:17:38,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:17:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-02 09:17:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 317. [2018-02-02 09:17:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 09:17:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 345 transitions. [2018-02-02 09:17:38,063 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 345 transitions. Word has length 530 [2018-02-02 09:17:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:38,064 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 345 transitions. [2018-02-02 09:17:38,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:17:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 345 transitions. [2018-02-02 09:17:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-02-02 09:17:38,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:38,068 INFO L351 BasicCegarLoop]: trace histogram [45, 39, 35, 35, 35, 35, 35, 29, 29, 29, 29, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:38,068 INFO L371 AbstractCegarLoop]: === Iteration 30 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1579835560, now seen corresponding path program 5 times [2018-02-02 09:17:38,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:38,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:38,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:38,069 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:38,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:38,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7993 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 7658 trivial. 0 not checked. [2018-02-02 09:17:38,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:38,657 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:38,662 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 09:17:38,702 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:38,709 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:38,720 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:38,733 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:38,867 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:39,118 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:39,510 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:41,099 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:41,107 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:41,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7993 backedges. 4046 proven. 128 refuted. 0 times theorem prover too weak. 3819 trivial. 0 not checked. [2018-02-02 09:17:41,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:41,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-02-02 09:17:41,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:17:41,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:17:41,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:17:41,488 INFO L87 Difference]: Start difference. First operand 317 states and 345 transitions. Second operand 27 states. [2018-02-02 09:17:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:42,154 INFO L93 Difference]: Finished difference Result 369 states and 396 transitions. [2018-02-02 09:17:42,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:17:42,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 624 [2018-02-02 09:17:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:42,155 INFO L225 Difference]: With dead ends: 369 [2018-02-02 09:17:42,156 INFO L226 Difference]: Without dead ends: 353 [2018-02-02 09:17:42,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:17:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-02 09:17:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 334. [2018-02-02 09:17:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 09:17:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 356 transitions. [2018-02-02 09:17:42,161 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 356 transitions. Word has length 624 [2018-02-02 09:17:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:42,161 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 356 transitions. [2018-02-02 09:17:42,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:17:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 356 transitions. [2018-02-02 09:17:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-02-02 09:17:42,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:42,165 INFO L351 BasicCegarLoop]: trace histogram [51, 45, 40, 40, 40, 40, 40, 34, 34, 34, 34, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:42,165 INFO L371 AbstractCegarLoop]: === Iteration 31 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1723936527, now seen corresponding path program 6 times [2018-02-02 09:17:42,165 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:42,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:42,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:42,166 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:42,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:42,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10474 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 10067 trivial. 0 not checked. [2018-02-02 09:17:42,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:42,801 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:42,821 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 09:17:42,866 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:42,871 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:42,878 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:42,892 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:42,908 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:42,990 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:43,171 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:43,433 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:44,047 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:45,218 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:46,836 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-02-02 09:17:46,844 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:46,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10474 backedges. 2204 proven. 38 refuted. 0 times theorem prover too weak. 8232 trivial. 0 not checked. [2018-02-02 09:17:47,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:47,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-02-02 09:17:47,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:17:47,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:17:47,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:17:47,147 INFO L87 Difference]: Start difference. First operand 334 states and 356 transitions. Second operand 24 states. [2018-02-02 09:17:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:47,431 INFO L93 Difference]: Finished difference Result 534 states and 604 transitions. [2018-02-02 09:17:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:17:47,432 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 704 [2018-02-02 09:17:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:47,435 INFO L225 Difference]: With dead ends: 534 [2018-02-02 09:17:47,435 INFO L226 Difference]: Without dead ends: 525 [2018-02-02 09:17:47,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:17:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-02-02 09:17:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 357. [2018-02-02 09:17:47,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-02 09:17:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 388 transitions. [2018-02-02 09:17:47,444 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 388 transitions. Word has length 704 [2018-02-02 09:17:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:47,445 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 388 transitions. [2018-02-02 09:17:47,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:17:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 388 transitions. [2018-02-02 09:17:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-02-02 09:17:47,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:47,451 INFO L351 BasicCegarLoop]: trace histogram [57, 57, 45, 45, 45, 45, 45, 45, 45, 45, 45, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:47,452 INFO L371 AbstractCegarLoop]: === Iteration 32 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash 324361008, now seen corresponding path program 7 times [2018-02-02 09:17:47,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:47,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:47,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:47,453 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:47,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:47,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 14684 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 14198 trivial. 0 not checked. [2018-02-02 09:17:48,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:48,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:48,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:48,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 14684 backedges. 8198 proven. 70 refuted. 0 times theorem prover too weak. 6416 trivial. 0 not checked. [2018-02-02 09:17:48,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:48,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-02-02 09:17:48,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:17:48,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:17:48,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:17:48,943 INFO L87 Difference]: Start difference. First operand 357 states and 388 transitions. Second operand 30 states. [2018-02-02 09:17:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:49,334 INFO L93 Difference]: Finished difference Result 876 states and 1019 transitions. [2018-02-02 09:17:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:17:49,334 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 814 [2018-02-02 09:17:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:49,336 INFO L225 Difference]: With dead ends: 876 [2018-02-02 09:17:49,336 INFO L226 Difference]: Without dead ends: 876 [2018-02-02 09:17:49,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=440, Invalid=1912, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 09:17:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-02-02 09:17:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 414. [2018-02-02 09:17:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-02 09:17:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 450 transitions. [2018-02-02 09:17:49,355 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 450 transitions. Word has length 814 [2018-02-02 09:17:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:49,355 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 450 transitions. [2018-02-02 09:17:49,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:17:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 450 transitions. [2018-02-02 09:17:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2018-02-02 09:17:49,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:49,361 INFO L351 BasicCegarLoop]: trace histogram [70, 62, 57, 57, 57, 57, 57, 49, 49, 49, 49, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:49,361 INFO L371 AbstractCegarLoop]: === Iteration 33 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash -362362842, now seen corresponding path program 8 times [2018-02-02 09:17:49,362 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:49,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:49,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:49,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:17:49,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:49,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 20144 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 19572 trivial. 0 not checked. [2018-02-02 09:17:50,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:50,325 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:50,331 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:17:50,377 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:50,483 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:50,507 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:50,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 20144 backedges. 9377 proven. 38 refuted. 0 times theorem prover too weak. 10729 trivial. 0 not checked. [2018-02-02 09:17:50,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:50,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-02-02 09:17:50,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:17:50,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:17:50,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:17:50,997 INFO L87 Difference]: Start difference. First operand 414 states and 450 transitions. Second operand 30 states. [2018-02-02 09:17:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:51,517 INFO L93 Difference]: Finished difference Result 456 states and 491 transitions. [2018-02-02 09:17:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:17:51,517 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 931 [2018-02-02 09:17:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:51,519 INFO L225 Difference]: With dead ends: 456 [2018-02-02 09:17:51,519 INFO L226 Difference]: Without dead ends: 440 [2018-02-02 09:17:51,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=439, Invalid=1913, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 09:17:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-02 09:17:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 413. [2018-02-02 09:17:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-02 09:17:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 441 transitions. [2018-02-02 09:17:51,528 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 441 transitions. Word has length 931 [2018-02-02 09:17:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:51,528 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 441 transitions. [2018-02-02 09:17:51,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:17:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 441 transitions. [2018-02-02 09:17:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2018-02-02 09:17:51,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:51,537 INFO L351 BasicCegarLoop]: trace histogram [77, 69, 63, 63, 63, 63, 63, 55, 55, 55, 55, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:51,538 INFO L371 AbstractCegarLoop]: === Iteration 34 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1709282318, now seen corresponding path program 9 times [2018-02-02 09:17:51,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:51,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:51,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:51,539 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:51,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:51,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24702 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 24037 trivial. 0 not checked. [2018-02-02 09:17:52,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:52,857 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:52,862 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 09:17:52,898 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:52,903 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:52,909 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:52,919 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:52,940 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:53,069 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:53,333 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 09:17:53,336 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:53,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 24702 backedges. 4118 proven. 60 refuted. 0 times theorem prover too weak. 20524 trivial. 0 not checked. [2018-02-02 09:17:53,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:53,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2018-02-02 09:17:53,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:17:53,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:17:53,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:17:53,789 INFO L87 Difference]: Start difference. First operand 413 states and 441 transitions. Second operand 28 states. [2018-02-02 09:17:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:54,237 INFO L93 Difference]: Finished difference Result 724 states and 831 transitions. [2018-02-02 09:17:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 09:17:54,237 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1022 [2018-02-02 09:17:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:54,240 INFO L225 Difference]: With dead ends: 724 [2018-02-02 09:17:54,240 INFO L226 Difference]: Without dead ends: 715 [2018-02-02 09:17:54,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1047 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:17:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-02 09:17:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 436. [2018-02-02 09:17:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-02 09:17:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 476 transitions. [2018-02-02 09:17:54,248 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 476 transitions. Word has length 1022 [2018-02-02 09:17:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:54,249 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 476 transitions. [2018-02-02 09:17:54,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:17:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 476 transitions. [2018-02-02 09:17:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2018-02-02 09:17:54,255 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:54,255 INFO L351 BasicCegarLoop]: trace histogram [84, 84, 69, 69, 69, 69, 69, 69, 69, 69, 69, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:54,255 INFO L371 AbstractCegarLoop]: === Iteration 35 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash 452446382, now seen corresponding path program 10 times [2018-02-02 09:17:54,256 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:54,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:54,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:54,256 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:54,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:54,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 32549 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 31784 trivial. 0 not checked. [2018-02-02 09:17:55,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:55,621 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:55,627 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 09:17:55,824 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:17:55,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:17:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 32549 backedges. 17085 proven. 102 refuted. 0 times theorem prover too weak. 15362 trivial. 0 not checked. [2018-02-02 09:17:56,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:17:56,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2018-02-02 09:17:56,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 09:17:56,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 09:17:56,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:17:56,424 INFO L87 Difference]: Start difference. First operand 436 states and 476 transitions. Second operand 35 states. [2018-02-02 09:17:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:17:56,935 INFO L93 Difference]: Finished difference Result 1181 states and 1393 transitions. [2018-02-02 09:17:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 09:17:56,936 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1153 [2018-02-02 09:17:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:17:56,941 INFO L225 Difference]: With dead ends: 1181 [2018-02-02 09:17:56,941 INFO L226 Difference]: Without dead ends: 1181 [2018-02-02 09:17:56,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1137 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=617, Invalid=2689, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 09:17:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-02-02 09:17:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 499. [2018-02-02 09:17:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-02 09:17:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 544 transitions. [2018-02-02 09:17:56,957 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 544 transitions. Word has length 1153 [2018-02-02 09:17:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:17:56,958 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 544 transitions. [2018-02-02 09:17:56,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 09:17:56,958 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 544 transitions. [2018-02-02 09:17:56,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1294 [2018-02-02 09:17:56,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:17:56,988 INFO L351 BasicCegarLoop]: trace histogram [100, 90, 84, 84, 84, 84, 84, 74, 74, 74, 74, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:17:56,988 INFO L371 AbstractCegarLoop]: === Iteration 36 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 09:17:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2142572569, now seen corresponding path program 11 times [2018-02-02 09:17:56,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:17:56,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:17:56,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:56,993 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:17:56,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:17:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:17:57,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:17:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 42453 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 41581 trivial. 0 not checked. [2018-02-02 09:17:58,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:17:58,864 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:17:58,868 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 09:17:58,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:58,932 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:17:59,181 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:18:00,459 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:18:03,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown