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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:20:54,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:20:54,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:20:54,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:20:54,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:20:54,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:20:54,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:20:54,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:20:54,873 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:20:54,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:20:54,874 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:20:54,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:20:54,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:20:54,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:20:54,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:20:54,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:20:54,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:20:54,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:20:54,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:20:54,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:20:54,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:20:54,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:20:54,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:20:54,886 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:20:54,887 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:20:54,888 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:20:54,888 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:20:54,889 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:20:54,889 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:20:54,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:20:54,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:20:54,889 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:20:54,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:20:54,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:20:54,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:20:54,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:20:54,899 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:20:54,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:20:54,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:20:54,900 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:20:54,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:20:54,900 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:20:54,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:20:54,900 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:20:54,901 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:20:54,901 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:20:54,901 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:20:54,901 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:20:54,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:20:54,901 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:20:54,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:20:54,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:20:54,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:20:54,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:20:54,902 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:20:54,902 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:20:54,902 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:20:54,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:20:54,940 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:20:54,943 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:20:54,944 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:20:54,944 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:20:54,945 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-04 00:20:55,051 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:20:55,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:20:55,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:20:55,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:20:55,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:20:55,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378098f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55, skipping insertion in model container [2018-02-04 00:20:55,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,075 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:20:55,089 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:20:55,172 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:20:55,186 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:20:55,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55 WrapperNode [2018-02-04 00:20:55,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:20:55,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:20:55,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:20:55,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:20:55,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (1/1) ... [2018-02-04 00:20:55,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:20:55,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:20:55,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:20:55,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:20:55,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (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-04 00:20:55,271 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:20:55,271 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:20:55,271 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-02-04 00:20:55,271 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 00:20:55,271 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:20:55,271 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:20:55,271 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:20:55,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:20:55,271 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:20:55,272 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:20:55,272 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-02-04 00:20:55,272 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 00:20:55,272 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:20:55,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:20:55,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:20:55,475 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:20:55,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:20:55 BoogieIcfgContainer [2018-02-04 00:20:55,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:20:55,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:20:55,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:20:55,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:20:55,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:20:55" (1/3) ... [2018-02-04 00:20:55,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c59add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:20:55, skipping insertion in model container [2018-02-04 00:20:55,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:20:55" (2/3) ... [2018-02-04 00:20:55,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c59add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:20:55, skipping insertion in model container [2018-02-04 00:20:55,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:20:55" (3/3) ... [2018-02-04 00:20:55,481 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-02-04 00:20:55,486 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:20:55,491 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-04 00:20:55,513 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:20:55,513 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:20:55,513 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:20:55,513 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:20:55,513 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:20:55,513 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:20:55,513 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:20:55,513 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:20:55,514 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:20:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-02-04 00:20:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 00:20:55,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:55,533 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:55,533 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1613294992, now seen corresponding path program 1 times [2018-02-04 00:20:55,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:55,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:55,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:55,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:55,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:55,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:55,625 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-04 00:20:55,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:55,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:20:55,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 00:20:55,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 00:20:55,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 00:20:55,640 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-02-04 00:20:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:55,654 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-02-04 00:20:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 00:20:55,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-04 00:20:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:55,661 INFO L225 Difference]: With dead ends: 68 [2018-02-04 00:20:55,661 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 00:20:55,662 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-04 00:20:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 00:20:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 00:20:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 00:20:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 00:20:55,687 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 13 [2018-02-04 00:20:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:55,687 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 00:20:55,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 00:20:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 00:20:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:20:55,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:55,688 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:55,688 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1969953325, now seen corresponding path program 1 times [2018-02-04 00:20:55,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:55,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:55,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:55,689 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:55,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:55,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:55,777 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-04 00:20:55,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:55,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:20:55,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:20:55,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:20:55,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:20:55,779 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 3 states. [2018-02-04 00:20:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:55,824 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-02-04 00:20:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:20:55,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 00:20:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:55,826 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:20:55,826 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 00:20:55,827 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-04 00:20:55,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 00:20:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-02-04 00:20:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 00:20:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 00:20:55,834 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 14 [2018-02-04 00:20:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:55,834 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 00:20:55,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:20:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 00:20:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:20:55,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:55,835 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:20:55,835 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:55,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1297061679, now seen corresponding path program 1 times [2018-02-04 00:20:55,835 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:55,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:55,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:55,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:55,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:55,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:55,923 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-04 00:20:55,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:55,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:20:55,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:20:55,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:20:55,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:20:55,925 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-02-04 00:20:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,018 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-02-04 00:20:56,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:20:56,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-02-04 00:20:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,020 INFO L225 Difference]: With dead ends: 85 [2018-02-04 00:20:56,020 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 00:20:56,020 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-04 00:20:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 00:20:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-02-04 00:20:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 00:20:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 00:20:56,027 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2018-02-04 00:20:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,027 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 00:20:56,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:20:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 00:20:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:20:56,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,028 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-04 00:20:56,028 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184185, now seen corresponding path program 1 times [2018-02-04 00:20:56,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:56,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:56,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,030 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:56,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:56,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:56,080 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-04 00:20:56,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:56,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:20:56,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:20:56,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:20:56,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:20:56,080 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 00:20:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,148 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 00:20:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:20:56,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 00:20:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,150 INFO L225 Difference]: With dead ends: 77 [2018-02-04 00:20:56,150 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 00:20:56,151 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-04 00:20:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 00:20:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 00:20:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 00:20:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 00:20:56,157 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 21 [2018-02-04 00:20:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,157 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 00:20:56,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:20:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 00:20:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 00:20:56,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,158 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-04 00:20:56,159 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1600184184, now seen corresponding path program 1 times [2018-02-04 00:20:56,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:56,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:56,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:56,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:56,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:56,215 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-04 00:20:56,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:56,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:20:56,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:20:56,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:20:56,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:20:56,216 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 7 states. [2018-02-04 00:20:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,311 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 00:20:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:20:56,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 00:20:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,312 INFO L225 Difference]: With dead ends: 89 [2018-02-04 00:20:56,313 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 00:20:56,313 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-04 00:20:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 00:20:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-02-04 00:20:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 00:20:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-04 00:20:56,318 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 21 [2018-02-04 00:20:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,318 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-04 00:20:56,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:20:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-04 00:20:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:20:56,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,319 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-04 00:20:56,319 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:56,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1759981910, now seen corresponding path program 1 times [2018-02-04 00:20:56,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:56,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:56,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:56,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:56,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:56,362 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-04 00:20:56,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:56,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:20:56,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:20:56,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:20:56,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:20:56,364 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 5 states. [2018-02-04 00:20:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,383 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-04 00:20:56,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:20:56,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 00:20:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,384 INFO L225 Difference]: With dead ends: 91 [2018-02-04 00:20:56,384 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 00:20:56,384 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-04 00:20:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 00:20:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-02-04 00:20:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 00:20:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-04 00:20:56,390 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 31 [2018-02-04 00:20:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,390 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-04 00:20:56,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:20:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-04 00:20:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:20:56,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,391 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-04 00:20:56,391 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash 216183673, now seen corresponding path program 1 times [2018-02-04 00:20:56,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:56,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:56,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:56,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:56,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:56,462 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-04 00:20:56,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:56,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:20:56,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:20:56,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:20:56,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:20:56,463 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 5 states. [2018-02-04 00:20:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,547 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-04 00:20:56,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:20:56,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-04 00:20:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,548 INFO L225 Difference]: With dead ends: 86 [2018-02-04 00:20:56,548 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 00:20:56,548 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-04 00:20:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 00:20:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 00:20:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 00:20:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-04 00:20:56,552 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 31 [2018-02-04 00:20:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,552 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-04 00:20:56,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:20:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-04 00:20:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:20:56,552 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,553 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-04 00:20:56,553 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash 216183674, now seen corresponding path program 1 times [2018-02-04 00:20:56,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:56,553 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:56,553 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,553 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:56,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:56,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:56,664 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-04 00:20:56,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:56,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:20:56,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:20:56,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:20:56,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:20:56,665 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 8 states. [2018-02-04 00:20:56,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,866 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-04 00:20:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:20:56,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 00:20:56,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,867 INFO L225 Difference]: With dead ends: 101 [2018-02-04 00:20:56,867 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 00:20:56,867 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-04 00:20:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 00:20:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-02-04 00:20:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 00:20:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-02-04 00:20:56,871 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 31 [2018-02-04 00:20:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,871 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-02-04 00:20:56,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:20:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-02-04 00:20:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:20:56,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,872 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-04 00:20:56,872 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -231887552, now seen corresponding path program 1 times [2018-02-04 00:20:56,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:56,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:56,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,873 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:56,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:56,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:56,955 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-04 00:20:56,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:56,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:20:56,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:20:56,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:20:56,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:20:56,956 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 5 states. [2018-02-04 00:20:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:56,995 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-02-04 00:20:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:20:56,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-02-04 00:20:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:56,995 INFO L225 Difference]: With dead ends: 96 [2018-02-04 00:20:56,996 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 00:20:56,996 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-04 00:20:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 00:20:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-02-04 00:20:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 00:20:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-04 00:20:56,998 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 42 [2018-02-04 00:20:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:56,999 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-04 00:20:56,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:20:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-04 00:20:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:20:56,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:56,999 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-04 00:20:57,000 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash -231887551, now seen corresponding path program 1 times [2018-02-04 00:20:57,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:57,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:57,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:57,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:57,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:57,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:57,155 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-04 00:20:57,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:57,155 INFO L213 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-04 00:20:57,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:57,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:57,220 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-04 00:20:57,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,226 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-04 00:20:57,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 00:20:57,278 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-04 00:20:57,292 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-04 00:20:57,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,295 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-04 00:20:57,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,297 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-04 00:20:57,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 00:20:57,347 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-04 00:20:57,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:20:57,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:20:57,368 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-04 00:20:57,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,377 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-04 00:20:57,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,385 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-04 00:20:57,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-02-04 00:20:57,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:20:57,525 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-04 00:20:57,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:20:57,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:20:57,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:20:57,548 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-04 00:20:57,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:20:57,562 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-04 00:20:57,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-02-04 00:20:57,640 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-04 00:20:57,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:20:57,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 00:20:57,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:20:57,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:20:57,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=322, Unknown=2, NotChecked=74, Total=462 [2018-02-04 00:20:57,676 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 22 states. [2018-02-04 00:20:59,062 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-04 00:20:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:59,392 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2018-02-04 00:20:59,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 00:20:59,392 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-02-04 00:20:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:59,394 INFO L225 Difference]: With dead ends: 234 [2018-02-04 00:20:59,394 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 00:20:59,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=379, Invalid=2071, Unknown=12, NotChecked=294, Total=2756 [2018-02-04 00:20:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 00:20:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 178. [2018-02-04 00:20:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 00:20:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2018-02-04 00:20:59,403 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 42 [2018-02-04 00:20:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:59,403 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2018-02-04 00:20:59,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:20:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2018-02-04 00:20:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:20:59,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:59,407 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-04 00:20:59,407 INFO L371 AbstractCegarLoop]: === Iteration 11 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1401420489, now seen corresponding path program 1 times [2018-02-04 00:20:59,407 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:59,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:59,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:59,408 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:59,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:59,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:59,503 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-04 00:20:59,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:59,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:20:59,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:20:59,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:20:59,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:20:59,504 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand 8 states. [2018-02-04 00:20:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:59,622 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2018-02-04 00:20:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:20:59,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-02-04 00:20:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:59,623 INFO L225 Difference]: With dead ends: 177 [2018-02-04 00:20:59,623 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 00:20:59,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:20:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 00:20:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-04 00:20:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 00:20:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2018-02-04 00:20:59,636 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 43 [2018-02-04 00:20:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:59,637 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2018-02-04 00:20:59,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:20:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2018-02-04 00:20:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:20:59,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:59,638 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-04 00:20:59,638 INFO L371 AbstractCegarLoop]: === Iteration 12 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1644784265, now seen corresponding path program 1 times [2018-02-04 00:20:59,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:59,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:59,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:59,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:59,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:59,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:59,682 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-04 00:20:59,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:20:59,682 INFO L213 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-04 00:20:59,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:59,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:20:59,742 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-04 00:20:59,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:20:59,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-02-04 00:20:59,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:20:59,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:20:59,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:20:59,771 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 9 states. [2018-02-04 00:20:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:20:59,855 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-02-04 00:20:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:20:59,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-04 00:20:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:20:59,856 INFO L225 Difference]: With dead ends: 141 [2018-02-04 00:20:59,856 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 00:20:59,856 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-04 00:20:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 00:20:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-02-04 00:20:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 00:20:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-04 00:20:59,860 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 46 [2018-02-04 00:20:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:20:59,861 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-04 00:20:59,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:20:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-04 00:20:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:20:59,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:20:59,862 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-04 00:20:59,862 INFO L371 AbstractCegarLoop]: === Iteration 13 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:20:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1096362099, now seen corresponding path program 1 times [2018-02-04 00:20:59,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:20:59,862 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:20:59,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:59,863 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:20:59,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:20:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:20:59,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:20:59,941 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-04 00:20:59,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:20:59,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:20:59,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:20:59,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:20:59,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:20:59,942 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 8 states. [2018-02-04 00:21:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:00,114 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-02-04 00:21:00,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:21:00,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-02-04 00:21:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:00,115 INFO L225 Difference]: With dead ends: 138 [2018-02-04 00:21:00,115 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 00:21:00,115 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-04 00:21:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 00:21:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2018-02-04 00:21:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 00:21:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-02-04 00:21:00,122 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 52 [2018-02-04 00:21:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:00,122 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-02-04 00:21:00,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:21:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-02-04 00:21:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 00:21:00,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:00,123 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-04 00:21:00,124 INFO L371 AbstractCegarLoop]: === Iteration 14 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1224161946, now seen corresponding path program 1 times [2018-02-04 00:21:00,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:00,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:00,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:00,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:00,125 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:00,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:00,217 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-04 00:21:00,217 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:00,217 INFO L213 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-04 00:21:00,224 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:00,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:00,278 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-04 00:21:00,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:00,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-02-04 00:21:00,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:21:00,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:21:00,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:21:00,298 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 15 states. [2018-02-04 00:21:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:00,431 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-04 00:21:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:21:00,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-04 00:21:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:00,431 INFO L225 Difference]: With dead ends: 138 [2018-02-04 00:21:00,431 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 00:21:00,432 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-04 00:21:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 00:21:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2018-02-04 00:21:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 00:21:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-02-04 00:21:00,435 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 57 [2018-02-04 00:21:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:00,435 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-02-04 00:21:00,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:21:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-02-04 00:21:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 00:21:00,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:00,436 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-04 00:21:00,436 INFO L371 AbstractCegarLoop]: === Iteration 15 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash -227989441, now seen corresponding path program 1 times [2018-02-04 00:21:00,437 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:00,437 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:00,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:00,438 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:00,438 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:00,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:00,541 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-04 00:21:00,541 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:00,541 INFO L213 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-04 00:21:00,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:00,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:00,636 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-04 00:21:00,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:21:00,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2018-02-04 00:21:00,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:21:00,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:21:00,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:21:00,656 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 14 states. [2018-02-04 00:21:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:00,833 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-04 00:21:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:21:00,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-04 00:21:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:00,834 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:21:00,834 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 00:21:00,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:21:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 00:21:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2018-02-04 00:21:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:21:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-04 00:21:00,836 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 62 [2018-02-04 00:21:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:00,836 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-04 00:21:00,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:21:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-04 00:21:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 00:21:00,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:00,837 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-04 00:21:00,837 INFO L371 AbstractCegarLoop]: === Iteration 16 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash 897277161, now seen corresponding path program 1 times [2018-02-04 00:21:00,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:00,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:00,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:00,838 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:00,838 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:00,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:01,009 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-04 00:21:01,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:01,010 INFO L213 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-04 00:21:01,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:01,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:01,097 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-04 00:21:01,098 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-04 00:21:01,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:01,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:21:01,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:21:01,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 00:21:01,235 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-04 00:21:01,238 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-04 00:21:01,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:01,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:21:01,247 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-04 00:21:01,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-02-04 00:21:01,336 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-04 00:21:03,491 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-04 00:21:03,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:03,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-02-04 00:21:03,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:21:03,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:21:03,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=938, Unknown=16, NotChecked=62, Total=1122 [2018-02-04 00:21:03,513 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 34 states. [2018-02-04 00:21:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:04,811 INFO L93 Difference]: Finished difference Result 191 states and 209 transitions. [2018-02-04 00:21:04,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 00:21:04,811 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-02-04 00:21:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:04,813 INFO L225 Difference]: With dead ends: 191 [2018-02-04 00:21:04,813 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 00:21:04,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=413, Invalid=3325, Unknown=48, NotChecked=120, Total=3906 [2018-02-04 00:21:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 00:21:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 139. [2018-02-04 00:21:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 00:21:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-02-04 00:21:04,820 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 67 [2018-02-04 00:21:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:04,820 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-02-04 00:21:04,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 00:21:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-02-04 00:21:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 00:21:04,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:04,821 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-04 00:21:04,821 INFO L371 AbstractCegarLoop]: === Iteration 17 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2066805359, now seen corresponding path program 1 times [2018-02-04 00:21:04,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:04,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:04,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:04,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:04,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:04,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:04,925 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-04 00:21:04,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:04,925 INFO L213 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-04 00:21:04,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:04,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:05,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:05,030 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-04 00:21:05,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:05,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:05,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:05,040 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-04 00:21:05,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:05,047 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-04 00:21:05,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28 [2018-02-04 00:21:05,092 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-04 00:21:05,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:05,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 00:21:05,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:21:05,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:21:05,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:21:05,111 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 19 states. [2018-02-04 00:21:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:05,440 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-02-04 00:21:05,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:21:05,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-02-04 00:21:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:05,441 INFO L225 Difference]: With dead ends: 143 [2018-02-04 00:21:05,441 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 00:21:05,441 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-04 00:21:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 00:21:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-02-04 00:21:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 00:21:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-02-04 00:21:05,444 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 78 [2018-02-04 00:21:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:05,444 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-02-04 00:21:05,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:21:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-02-04 00:21:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-04 00:21:05,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:05,446 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-04 00:21:05,446 INFO L371 AbstractCegarLoop]: === Iteration 18 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash -864143526, now seen corresponding path program 1 times [2018-02-04 00:21:05,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:05,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:05,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:05,447 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:05,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:05,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:05,488 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-04 00:21:05,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:05,488 INFO L213 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-04 00:21:05,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:05,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:05,530 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-04 00:21:05,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:05,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 00:21:05,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:21:05,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:21:05,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:21:05,552 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 6 states. [2018-02-04 00:21:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:05,600 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-04 00:21:05,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:21:05,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-02-04 00:21:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:05,601 INFO L225 Difference]: With dead ends: 145 [2018-02-04 00:21:05,601 INFO L226 Difference]: Without dead ends: 145 [2018-02-04 00:21:05,601 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-04 00:21:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-04 00:21:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-02-04 00:21:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 00:21:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-02-04 00:21:05,605 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 80 [2018-02-04 00:21:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:05,605 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-02-04 00:21:05,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:21:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-02-04 00:21:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 00:21:05,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:05,606 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-04 00:21:05,606 INFO L371 AbstractCegarLoop]: === Iteration 19 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash -999779067, now seen corresponding path program 2 times [2018-02-04 00:21:05,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:05,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:05,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:05,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:05,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:05,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:05,790 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-04 00:21:05,790 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:05,790 INFO L213 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-04 00:21:05,794 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:21:05,814 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:21:05,814 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:05,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:05,890 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:05,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:05,891 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-04 00:21:05,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:05,898 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-04 00:21:05,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:05,904 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-04 00:21:05,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:30 [2018-02-04 00:21:06,056 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-04 00:21:06,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:06,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-02-04 00:21:06,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:21:06,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:21:06,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:21:06,076 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 22 states. [2018-02-04 00:21:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:06,536 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-02-04 00:21:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:21:06,536 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-02-04 00:21:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:06,536 INFO L225 Difference]: With dead ends: 141 [2018-02-04 00:21:06,537 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 00:21:06,537 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-04 00:21:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 00:21:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2018-02-04 00:21:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-04 00:21:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2018-02-04 00:21:06,540 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 84 [2018-02-04 00:21:06,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:06,541 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2018-02-04 00:21:06,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:21:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2018-02-04 00:21:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 00:21:06,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:06,542 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-04 00:21:06,542 INFO L371 AbstractCegarLoop]: === Iteration 20 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash 311899052, now seen corresponding path program 2 times [2018-02-04 00:21:06,542 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:06,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:06,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:06,543 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:06,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:06,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:06,650 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-04 00:21:06,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:06,650 INFO L213 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-04 00:21:06,655 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:21:06,680 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:21:06,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:06,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:06,750 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-04 00:21:06,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:06,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-02-04 00:21:06,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:21:06,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:21:06,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:21:06,769 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 17 states. [2018-02-04 00:21:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:07,023 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-04 00:21:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:21:07,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-02-04 00:21:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:07,023 INFO L225 Difference]: With dead ends: 148 [2018-02-04 00:21:07,023 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 00:21:07,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:21:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 00:21:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2018-02-04 00:21:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 00:21:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-02-04 00:21:07,025 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 93 [2018-02-04 00:21:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:07,026 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-02-04 00:21:07,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:21:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-02-04 00:21:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 00:21:07,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:07,026 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-04 00:21:07,026 INFO L371 AbstractCegarLoop]: === Iteration 21 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash -52037211, now seen corresponding path program 2 times [2018-02-04 00:21:07,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:07,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:07,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:07,027 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:07,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:07,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:07,145 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-04 00:21:07,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:07,145 INFO L213 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-04 00:21:07,150 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:21:07,173 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:21:07,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:07,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:07,226 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-04 00:21:07,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:07,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-04 00:21:07,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:21:07,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:21:07,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:21:07,244 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 19 states. [2018-02-04 00:21:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:07,493 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-02-04 00:21:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:21:07,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-02-04 00:21:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:07,496 INFO L225 Difference]: With dead ends: 164 [2018-02-04 00:21:07,496 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 00:21:07,497 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-04 00:21:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 00:21:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-02-04 00:21:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 00:21:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-02-04 00:21:07,499 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 109 [2018-02-04 00:21:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:07,499 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-02-04 00:21:07,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:21:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-02-04 00:21:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 00:21:07,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:07,500 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-04 00:21:07,500 INFO L371 AbstractCegarLoop]: === Iteration 22 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1577506560, now seen corresponding path program 3 times [2018-02-04 00:21:07,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:07,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:07,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:07,501 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:07,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:07,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:07,932 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-04 00:21:07,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:07,933 INFO L213 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-04 00:21:07,940 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:21:07,987 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 00:21:07,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:07,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:07,995 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-04 00:21:07,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,001 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-04 00:21:08,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 00:21:08,028 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-04 00:21:08,033 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-04 00:21:08,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,037 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-04 00:21:08,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,039 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-04 00:21:08,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 00:21:08,505 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-04 00:21:08,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:08,512 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-04 00:21:08,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:08,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:08,521 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-04 00:21:08,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,526 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-04 00:21:08,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-02-04 00:21:08,599 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-04 00:21:08,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,601 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-04 00:21:08,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,603 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-04 00:21:08,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 00:21:08,608 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-04 00:21:08,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:08,622 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-04 00:21:08,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:21:08,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:08,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:08,647 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-04 00:21:08,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,662 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-04 00:21:08,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:45, output treesize:66 [2018-02-04 00:21:08,817 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-04 00:21:08,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,821 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-04 00:21:08,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:08,822 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-04 00:21:08,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-02-04 00:21:09,546 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-04 00:21:09,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:09,569 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-04 00:21:09,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 00:21:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:21:09,597 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-04 00:21:09,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:21:09,614 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-04 00:21:09,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:60, output treesize:96 [2018-02-04 00:21:09,708 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-04 00:21:09,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:09,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 33 [2018-02-04 00:21:09,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 00:21:09,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 00:21:09,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=735, Unknown=7, NotChecked=236, Total=1122 [2018-02-04 00:21:09,727 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 34 states. [2018-02-04 00:21:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:10,354 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-02-04 00:21:10,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:21:10,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 114 [2018-02-04 00:21:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:10,364 INFO L225 Difference]: With dead ends: 134 [2018-02-04 00:21:10,364 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 00:21:10,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=281, Invalid=1450, Unknown=7, NotChecked=332, Total=2070 [2018-02-04 00:21:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 00:21:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-04 00:21:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 00:21:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-02-04 00:21:10,368 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 114 [2018-02-04 00:21:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:10,368 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-02-04 00:21:10,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 00:21:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-02-04 00:21:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 00:21:10,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:10,369 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-04 00:21:10,369 INFO L371 AbstractCegarLoop]: === Iteration 23 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash -308556470, now seen corresponding path program 1 times [2018-02-04 00:21:10,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:10,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:10,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:10,371 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:10,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:10,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:10,442 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-04 00:21:10,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:10,442 INFO L213 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-04 00:21:10,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:10,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:10,512 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-04 00:21:10,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:10,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 00:21:10,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:21:10,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:21:10,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:21:10,536 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 7 states. [2018-02-04 00:21:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:10,560 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-04 00:21:10,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:21:10,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-02-04 00:21:10,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:10,561 INFO L225 Difference]: With dead ends: 146 [2018-02-04 00:21:10,561 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 00:21:10,561 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-04 00:21:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 00:21:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2018-02-04 00:21:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 00:21:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-02-04 00:21:10,564 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 122 [2018-02-04 00:21:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:10,564 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-02-04 00:21:10,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:21:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-02-04 00:21:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 00:21:10,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:10,566 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-04 00:21:10,566 INFO L371 AbstractCegarLoop]: === Iteration 24 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash -974589226, now seen corresponding path program 2 times [2018-02-04 00:21:10,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:10,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:10,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:10,567 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:10,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:10,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:10,653 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-04 00:21:10,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:10,654 INFO L213 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-04 00:21:10,661 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:21:10,710 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:21:10,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:10,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:10,773 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-04 00:21:10,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:10,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2018-02-04 00:21:10,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 00:21:10,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 00:21:10,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:21:10,793 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 16 states. [2018-02-04 00:21:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:10,960 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-02-04 00:21:10,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:21:10,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2018-02-04 00:21:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:10,961 INFO L225 Difference]: With dead ends: 208 [2018-02-04 00:21:10,968 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 00:21:10,968 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-04 00:21:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 00:21:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2018-02-04 00:21:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 00:21:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2018-02-04 00:21:10,971 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 169 [2018-02-04 00:21:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:10,974 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2018-02-04 00:21:10,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 00:21:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2018-02-04 00:21:10,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-02-04 00:21:10,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:10,976 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-04 00:21:10,976 INFO L371 AbstractCegarLoop]: === Iteration 25 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1271505270, now seen corresponding path program 3 times [2018-02-04 00:21:10,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:10,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:10,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:10,977 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:10,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:11,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:11,110 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-04 00:21:11,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:11,111 INFO L213 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-04 00:21:11,118 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:21:11,143 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 00:21:11,143 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:11,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:11,200 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-04 00:21:11,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:21:11,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2018-02-04 00:21:11,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:21:11,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:21:11,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:21:11,238 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand 11 states. [2018-02-04 00:21:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:11,467 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2018-02-04 00:21:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 00:21:11,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2018-02-04 00:21:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:11,469 INFO L225 Difference]: With dead ends: 191 [2018-02-04 00:21:11,469 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 00:21:11,469 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-04 00:21:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 00:21:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 183. [2018-02-04 00:21:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 00:21:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2018-02-04 00:21:11,473 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 228 [2018-02-04 00:21:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:11,474 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2018-02-04 00:21:11,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:21:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-02-04 00:21:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-02-04 00:21:11,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:11,475 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-04 00:21:11,475 INFO L371 AbstractCegarLoop]: === Iteration 26 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1986892732, now seen corresponding path program 1 times [2018-02-04 00:21:11,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:11,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:11,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:11,476 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:11,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:11,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:11,652 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-04 00:21:11,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:11,652 INFO L213 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-04 00:21:11,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:11,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:11,853 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-04 00:21:11,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:11,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2018-02-04 00:21:11,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:21:11,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:21:11,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:21:11,872 INFO L87 Difference]: Start difference. First operand 183 states and 193 transitions. Second operand 19 states. [2018-02-04 00:21:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:12,137 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-02-04 00:21:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:21:12,137 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 286 [2018-02-04 00:21:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:12,138 INFO L225 Difference]: With dead ends: 223 [2018-02-04 00:21:12,138 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 00:21:12,138 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-04 00:21:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 00:21:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2018-02-04 00:21:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 00:21:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2018-02-04 00:21:12,142 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 286 [2018-02-04 00:21:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:12,142 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2018-02-04 00:21:12,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:21:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2018-02-04 00:21:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-04 00:21:12,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:12,145 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-04 00:21:12,145 INFO L371 AbstractCegarLoop]: === Iteration 27 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1059600550, now seen corresponding path program 2 times [2018-02-04 00:21:12,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:12,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:12,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:12,146 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:12,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:12,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:12,406 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-04 00:21:12,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:12,407 INFO L213 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-04 00:21:12,414 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:21:12,495 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:21:12,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:12,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:12,628 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-04 00:21:12,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:12,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-04 00:21:12,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:21:12,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:21:12,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:21:12,647 INFO L87 Difference]: Start difference. First operand 198 states and 209 transitions. Second operand 21 states. [2018-02-04 00:21:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:12,927 INFO L93 Difference]: Finished difference Result 305 states and 332 transitions. [2018-02-04 00:21:12,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:21:12,927 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 359 [2018-02-04 00:21:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:12,929 INFO L225 Difference]: With dead ends: 305 [2018-02-04 00:21:12,929 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 00:21:12,930 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-04 00:21:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 00:21:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-02-04 00:21:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 00:21:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-04 00:21:12,934 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 359 [2018-02-04 00:21:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:12,935 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-04 00:21:12,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:21:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-04 00:21:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-02-04 00:21:12,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:12,937 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-04 00:21:12,937 INFO L371 AbstractCegarLoop]: === Iteration 28 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:12,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1405874031, now seen corresponding path program 3 times [2018-02-04 00:21:12,937 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:12,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:12,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:12,938 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:12,938 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:12,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:13,206 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-04 00:21:13,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:13,206 INFO L213 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-04 00:21:13,214 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:21:13,311 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 00:21:13,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:13,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:13,520 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-04 00:21:13,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:13,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-02-04 00:21:13,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:21:13,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:21:13,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:21:13,556 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 20 states. [2018-02-04 00:21:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:13,866 INFO L93 Difference]: Finished difference Result 349 states and 389 transitions. [2018-02-04 00:21:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:21:13,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 441 [2018-02-04 00:21:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:13,868 INFO L225 Difference]: With dead ends: 349 [2018-02-04 00:21:13,868 INFO L226 Difference]: Without dead ends: 340 [2018-02-04 00:21:13,868 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-04 00:21:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-04 00:21:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 266. [2018-02-04 00:21:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-02-04 00:21:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 289 transitions. [2018-02-04 00:21:13,875 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 289 transitions. Word has length 441 [2018-02-04 00:21:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:13,875 INFO L432 AbstractCegarLoop]: Abstraction has 266 states and 289 transitions. [2018-02-04 00:21:13,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:21:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 289 transitions. [2018-02-04 00:21:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-02-04 00:21:13,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:13,877 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-04 00:21:13,877 INFO L371 AbstractCegarLoop]: === Iteration 29 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:13,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1260936207, now seen corresponding path program 4 times [2018-02-04 00:21:13,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:13,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:13,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:13,878 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:13,878 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:13,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:14,285 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-04 00:21:14,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:14,286 INFO L213 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-04 00:21:14,291 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:21:14,425 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:21:14,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:14,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:14,630 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-04 00:21:14,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:14,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-04 00:21:14,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 00:21:14,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 00:21:14,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:21:14,650 INFO L87 Difference]: Start difference. First operand 266 states and 289 transitions. Second operand 25 states. [2018-02-04 00:21:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:15,040 INFO L93 Difference]: Finished difference Result 602 states and 697 transitions. [2018-02-04 00:21:15,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:21:15,040 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 530 [2018-02-04 00:21:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:15,043 INFO L225 Difference]: With dead ends: 602 [2018-02-04 00:21:15,044 INFO L226 Difference]: Without dead ends: 602 [2018-02-04 00:21:15,044 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-04 00:21:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-04 00:21:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 317. [2018-02-04 00:21:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-04 00:21:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 345 transitions. [2018-02-04 00:21:15,055 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 345 transitions. Word has length 530 [2018-02-04 00:21:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:15,055 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 345 transitions. [2018-02-04 00:21:15,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 00:21:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 345 transitions. [2018-02-04 00:21:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2018-02-04 00:21:15,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:15,060 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-04 00:21:15,060 INFO L371 AbstractCegarLoop]: === Iteration 30 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1579835560, now seen corresponding path program 5 times [2018-02-04 00:21:15,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:15,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:15,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:15,061 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:15,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:15,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:15,609 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-04 00:21:15,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:15,610 INFO L213 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-04 00:21:15,618 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:21:17,796 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-04 00:21:17,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:17,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:18,184 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-04 00:21:18,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:18,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-02-04 00:21:18,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:21:18,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:21:18,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:21:18,222 INFO L87 Difference]: Start difference. First operand 317 states and 345 transitions. Second operand 27 states. [2018-02-04 00:21:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:18,908 INFO L93 Difference]: Finished difference Result 369 states and 396 transitions. [2018-02-04 00:21:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 00:21:18,908 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 624 [2018-02-04 00:21:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:18,909 INFO L225 Difference]: With dead ends: 369 [2018-02-04 00:21:18,909 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 00:21:18,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1929, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:21:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 00:21:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 334. [2018-02-04 00:21:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-04 00:21:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 356 transitions. [2018-02-04 00:21:18,916 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 356 transitions. Word has length 624 [2018-02-04 00:21:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:18,917 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 356 transitions. [2018-02-04 00:21:18,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:21:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 356 transitions. [2018-02-04 00:21:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2018-02-04 00:21:18,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:18,922 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-04 00:21:18,922 INFO L371 AbstractCegarLoop]: === Iteration 31 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1723936527, now seen corresponding path program 6 times [2018-02-04 00:21:18,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:18,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:18,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:18,923 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:18,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:18,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:19,499 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-04 00:21:19,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:19,500 INFO L213 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-04 00:21:19,505 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:21:23,281 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-02-04 00:21:23,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:23,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:23,616 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-04 00:21:23,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:23,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-02-04 00:21:23,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 00:21:23,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 00:21:23,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:21:23,638 INFO L87 Difference]: Start difference. First operand 334 states and 356 transitions. Second operand 24 states. [2018-02-04 00:21:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:23,888 INFO L93 Difference]: Finished difference Result 534 states and 604 transitions. [2018-02-04 00:21:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 00:21:23,888 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 704 [2018-02-04 00:21:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:23,891 INFO L225 Difference]: With dead ends: 534 [2018-02-04 00:21:23,891 INFO L226 Difference]: Without dead ends: 525 [2018-02-04 00:21:23,892 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-04 00:21:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-02-04 00:21:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 357. [2018-02-04 00:21:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-04 00:21:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 388 transitions. [2018-02-04 00:21:23,905 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 388 transitions. Word has length 704 [2018-02-04 00:21:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:23,906 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 388 transitions. [2018-02-04 00:21:23,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 00:21:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 388 transitions. [2018-02-04 00:21:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-02-04 00:21:23,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:23,913 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-04 00:21:23,913 INFO L371 AbstractCegarLoop]: === Iteration 32 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash 324361008, now seen corresponding path program 7 times [2018-02-04 00:21:23,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:23,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:23,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:23,914 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:23,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:23,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:24,677 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-04 00:21:24,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:24,677 INFO L213 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-04 00:21:24,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:24,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:25,270 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-04 00:21:25,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:25,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-02-04 00:21:25,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 00:21:25,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 00:21:25,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:21:25,303 INFO L87 Difference]: Start difference. First operand 357 states and 388 transitions. Second operand 30 states. [2018-02-04 00:21:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:25,646 INFO L93 Difference]: Finished difference Result 876 states and 1019 transitions. [2018-02-04 00:21:25,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 00:21:25,646 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 814 [2018-02-04 00:21:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:25,650 INFO L225 Difference]: With dead ends: 876 [2018-02-04 00:21:25,650 INFO L226 Difference]: Without dead ends: 876 [2018-02-04 00:21:25,650 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-04 00:21:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-02-04 00:21:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 414. [2018-02-04 00:21:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-02-04 00:21:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 450 transitions. [2018-02-04 00:21:25,664 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 450 transitions. Word has length 814 [2018-02-04 00:21:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:25,664 INFO L432 AbstractCegarLoop]: Abstraction has 414 states and 450 transitions. [2018-02-04 00:21:25,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 00:21:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 450 transitions. [2018-02-04 00:21:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2018-02-04 00:21:25,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:25,672 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-04 00:21:25,672 INFO L371 AbstractCegarLoop]: === Iteration 33 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash -362362842, now seen corresponding path program 8 times [2018-02-04 00:21:25,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:25,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:25,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:25,674 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:21:25,674 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:25,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:26,643 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-04 00:21:26,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:26,643 INFO L213 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-04 00:21:26,649 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:21:26,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:21:26,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:26,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:27,245 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-04 00:21:27,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:27,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-02-04 00:21:27,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 00:21:27,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 00:21:27,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:21:27,267 INFO L87 Difference]: Start difference. First operand 414 states and 450 transitions. Second operand 30 states. [2018-02-04 00:21:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:27,721 INFO L93 Difference]: Finished difference Result 456 states and 491 transitions. [2018-02-04 00:21:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 00:21:27,721 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 931 [2018-02-04 00:21:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:27,723 INFO L225 Difference]: With dead ends: 456 [2018-02-04 00:21:27,723 INFO L226 Difference]: Without dead ends: 440 [2018-02-04 00:21:27,723 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-04 00:21:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-04 00:21:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 413. [2018-02-04 00:21:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 00:21:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 441 transitions. [2018-02-04 00:21:27,730 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 441 transitions. Word has length 931 [2018-02-04 00:21:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:27,731 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 441 transitions. [2018-02-04 00:21:27,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 00:21:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 441 transitions. [2018-02-04 00:21:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2018-02-04 00:21:27,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:27,737 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-04 00:21:27,737 INFO L371 AbstractCegarLoop]: === Iteration 34 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1709282318, now seen corresponding path program 9 times [2018-02-04 00:21:27,738 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:27,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:27,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:27,738 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:27,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:27,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:28,768 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-04 00:21:28,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:28,769 INFO L213 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-04 00:21:28,774 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:21:29,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-02-04 00:21:29,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:29,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:29,661 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-04 00:21:29,682 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:29,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2018-02-04 00:21:29,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 00:21:29,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 00:21:29,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:21:29,683 INFO L87 Difference]: Start difference. First operand 413 states and 441 transitions. Second operand 28 states. [2018-02-04 00:21:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:30,074 INFO L93 Difference]: Finished difference Result 724 states and 831 transitions. [2018-02-04 00:21:30,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 00:21:30,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1022 [2018-02-04 00:21:30,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:30,076 INFO L225 Difference]: With dead ends: 724 [2018-02-04 00:21:30,077 INFO L226 Difference]: Without dead ends: 715 [2018-02-04 00:21:30,077 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-04 00:21:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-02-04 00:21:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 436. [2018-02-04 00:21:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-02-04 00:21:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 476 transitions. [2018-02-04 00:21:30,084 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 476 transitions. Word has length 1022 [2018-02-04 00:21:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:30,084 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 476 transitions. [2018-02-04 00:21:30,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 00:21:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 476 transitions. [2018-02-04 00:21:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2018-02-04 00:21:30,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:30,093 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-04 00:21:30,093 INFO L371 AbstractCegarLoop]: === Iteration 35 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:30,093 INFO L82 PathProgramCache]: Analyzing trace with hash 452446382, now seen corresponding path program 10 times [2018-02-04 00:21:30,093 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:30,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:30,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:30,094 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:30,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:30,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:31,429 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-04 00:21:31,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:31,429 INFO L213 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-04 00:21:31,434 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:21:31,614 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:21:31,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:21:31,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:21:32,143 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-04 00:21:32,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:21:32,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2018-02-04 00:21:32,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 00:21:32,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 00:21:32,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 00:21:32,178 INFO L87 Difference]: Start difference. First operand 436 states and 476 transitions. Second operand 35 states. [2018-02-04 00:21:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:21:32,630 INFO L93 Difference]: Finished difference Result 1181 states and 1393 transitions. [2018-02-04 00:21:32,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 00:21:32,630 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1153 [2018-02-04 00:21:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:21:32,636 INFO L225 Difference]: With dead ends: 1181 [2018-02-04 00:21:32,636 INFO L226 Difference]: Without dead ends: 1181 [2018-02-04 00:21:32,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1193 GetRequests, 1137 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=617, Invalid=2689, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 00:21:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-02-04 00:21:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 499. [2018-02-04 00:21:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 00:21:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 544 transitions. [2018-02-04 00:21:32,653 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 544 transitions. Word has length 1153 [2018-02-04 00:21:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:21:32,654 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 544 transitions. [2018-02-04 00:21:32,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 00:21:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 544 transitions. [2018-02-04 00:21:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1294 [2018-02-04 00:21:32,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:21:32,668 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-04 00:21:32,668 INFO L371 AbstractCegarLoop]: === Iteration 36 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:21:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2142572569, now seen corresponding path program 11 times [2018-02-04 00:21:32,669 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:21:32,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:21:32,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:32,669 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:21:32,670 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:21:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:21:32,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:21:34,310 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-04 00:21:34,310 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:21:34,310 INFO L213 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-04 00:21:34,315 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:22:02,919 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 00:22:02,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:22:02,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:22:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 42453 backedges. 18458 proven. 92 refuted. 0 times theorem prover too weak. 23903 trivial. 0 not checked. [2018-02-04 00:22:03,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:22:03,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2018-02-04 00:22:03,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 00:22:03,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 00:22:03,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 00:22:03,538 INFO L87 Difference]: Start difference. First operand 499 states and 544 transitions. Second operand 33 states. [2018-02-04 00:22:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:22:04,133 INFO L93 Difference]: Finished difference Result 683 states and 775 transitions. [2018-02-04 00:22:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 00:22:04,133 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 1293 [2018-02-04 00:22:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:22:04,135 INFO L225 Difference]: With dead ends: 683 [2018-02-04 00:22:04,135 INFO L226 Difference]: Without dead ends: 683 [2018-02-04 00:22:04,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 1280 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:22:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-02-04 00:22:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 580. [2018-02-04 00:22:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-02-04 00:22:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 633 transitions. [2018-02-04 00:22:04,142 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 633 transitions. Word has length 1293 [2018-02-04 00:22:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:22:04,142 INFO L432 AbstractCegarLoop]: Abstraction has 580 states and 633 transitions. [2018-02-04 00:22:04,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 00:22:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 633 transitions. [2018-02-04 00:22:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1396 [2018-02-04 00:22:04,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:22:04,152 INFO L351 BasicCegarLoop]: trace histogram [108, 98, 91, 91, 91, 91, 91, 81, 81, 81, 81, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:22:04,152 INFO L371 AbstractCegarLoop]: === Iteration 37 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:22:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash 719366254, now seen corresponding path program 12 times [2018-02-04 00:22:04,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:22:04,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:22:04,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:22:04,153 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:22:04,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:22:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:22:04,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:22:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 49992 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 49006 trivial. 0 not checked. [2018-02-04 00:22:05,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:22:05,995 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:22:06,000 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:23:36,763 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-02-04 00:23:36,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:23:36,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:23:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 49992 backedges. 6862 proven. 87 refuted. 0 times theorem prover too weak. 43043 trivial. 0 not checked. [2018-02-04 00:23:37,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:23:37,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 30 [2018-02-04 00:23:37,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 00:23:37,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 00:23:37,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2018-02-04 00:23:37,360 INFO L87 Difference]: Start difference. First operand 580 states and 633 transitions. Second operand 30 states. [2018-02-04 00:23:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:23:37,735 INFO L93 Difference]: Finished difference Result 1012 states and 1183 transitions. [2018-02-04 00:23:37,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 00:23:37,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1395 [2018-02-04 00:23:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:23:37,738 INFO L225 Difference]: With dead ends: 1012 [2018-02-04 00:23:37,738 INFO L226 Difference]: Without dead ends: 1003 [2018-02-04 00:23:37,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1386 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=1101, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 00:23:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-02-04 00:23:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 603. [2018-02-04 00:23:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-02-04 00:23:37,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 673 transitions. [2018-02-04 00:23:37,752 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 673 transitions. Word has length 1395 [2018-02-04 00:23:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:23:37,753 INFO L432 AbstractCegarLoop]: Abstraction has 603 states and 673 transitions. [2018-02-04 00:23:37,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 00:23:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 673 transitions. [2018-02-04 00:23:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1548 [2018-02-04 00:23:37,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:23:37,770 INFO L351 BasicCegarLoop]: trace histogram [116, 116, 98, 98, 98, 98, 98, 98, 98, 98, 98, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:23:37,771 INFO L371 AbstractCegarLoop]: === Iteration 38 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:23:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1789902741, now seen corresponding path program 13 times [2018-02-04 00:23:37,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:23:37,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:23:37,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:37,772 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:23:37,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:23:37,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:23:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 63136 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 62029 trivial. 0 not checked. [2018-02-04 00:23:40,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:23:40,162 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:23:40,167 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:23:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:23:40,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:23:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 63136 backedges. 31434 proven. 140 refuted. 0 times theorem prover too weak. 31562 trivial. 0 not checked. [2018-02-04 00:23:41,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:23:41,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-02-04 00:23:41,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 00:23:41,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 00:23:41,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:23:41,145 INFO L87 Difference]: Start difference. First operand 603 states and 673 transitions. Second operand 40 states. [2018-02-04 00:23:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:23:41,668 INFO L93 Difference]: Finished difference Result 1553 states and 1849 transitions. [2018-02-04 00:23:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 00:23:41,669 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1547 [2018-02-04 00:23:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:23:41,675 INFO L225 Difference]: With dead ends: 1553 [2018-02-04 00:23:41,675 INFO L226 Difference]: Without dead ends: 1553 [2018-02-04 00:23:41,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1594 GetRequests, 1529 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=825, Invalid=3597, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 00:23:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2018-02-04 00:23:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 672. [2018-02-04 00:23:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-02-04 00:23:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 747 transitions. [2018-02-04 00:23:41,695 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 747 transitions. Word has length 1547 [2018-02-04 00:23:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:23:41,696 INFO L432 AbstractCegarLoop]: Abstraction has 672 states and 747 transitions. [2018-02-04 00:23:41,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 00:23:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 747 transitions. [2018-02-04 00:23:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1711 [2018-02-04 00:23:41,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:23:41,717 INFO L351 BasicCegarLoop]: trace histogram [135, 123, 116, 116, 116, 116, 116, 104, 104, 104, 104, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:23:41,717 INFO L371 AbstractCegarLoop]: === Iteration 39 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:23:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2068100029, now seen corresponding path program 14 times [2018-02-04 00:23:41,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:23:41,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:23:41,718 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:41,718 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:23:41,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:23:41,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:23:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 79405 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 78170 trivial. 0 not checked. [2018-02-04 00:23:44,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:23:44,670 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:23:44,676 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:23:44,937 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:23:44,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:23:44,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:23:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 79405 backedges. 33239 proven. 87 refuted. 0 times theorem prover too weak. 46079 trivial. 0 not checked. [2018-02-04 00:23:45,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:23:45,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-02-04 00:23:45,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 00:23:45,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 00:23:45,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1243, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:23:45,780 INFO L87 Difference]: Start difference. First operand 672 states and 747 transitions. Second operand 40 states. [2018-02-04 00:23:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:23:46,333 INFO L93 Difference]: Finished difference Result 712 states and 784 transitions. [2018-02-04 00:23:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 00:23:46,333 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1710 [2018-02-04 00:23:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:23:46,335 INFO L225 Difference]: With dead ends: 712 [2018-02-04 00:23:46,335 INFO L226 Difference]: Without dead ends: 696 [2018-02-04 00:23:46,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1758 GetRequests, 1693 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=828, Invalid=3594, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 00:23:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-02-04 00:23:46,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 671. [2018-02-04 00:23:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-02-04 00:23:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 734 transitions. [2018-02-04 00:23:46,340 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 734 transitions. Word has length 1710 [2018-02-04 00:23:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:23:46,341 INFO L432 AbstractCegarLoop]: Abstraction has 671 states and 734 transitions. [2018-02-04 00:23:46,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 00:23:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 734 transitions. [2018-02-04 00:23:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1824 [2018-02-04 00:23:46,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:23:46,355 INFO L351 BasicCegarLoop]: trace histogram [144, 132, 124, 124, 124, 124, 124, 112, 112, 112, 112, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:23:46,355 INFO L371 AbstractCegarLoop]: === Iteration 40 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:23:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1044979833, now seen corresponding path program 15 times [2018-02-04 00:23:46,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:23:46,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:23:46,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:46,356 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:23:46,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:23:46,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:23:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 90994 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 89624 trivial. 0 not checked. [2018-02-04 00:23:49,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:23:49,732 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:23:49,736 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:23:51,325 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-02-04 00:23:51,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:23:51,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:23:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 90994 backedges. 10599 proven. 235 refuted. 0 times theorem prover too weak. 80160 trivial. 0 not checked. [2018-02-04 00:23:52,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:23:52,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 39 [2018-02-04 00:23:52,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 00:23:52,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 00:23:52,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 00:23:52,361 INFO L87 Difference]: Start difference. First operand 671 states and 734 transitions. Second operand 39 states. [2018-02-04 00:23:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:23:53,177 INFO L93 Difference]: Finished difference Result 1270 states and 1500 transitions. [2018-02-04 00:23:53,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 00:23:53,177 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1823 [2018-02-04 00:23:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:23:53,182 INFO L225 Difference]: With dead ends: 1270 [2018-02-04 00:23:53,182 INFO L226 Difference]: Without dead ends: 1261 [2018-02-04 00:23:53,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 1890 GetRequests, 1808 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1094, Invalid=5878, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 00:23:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2018-02-04 00:23:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 694. [2018-02-04 00:23:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-02-04 00:23:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 777 transitions. [2018-02-04 00:23:53,194 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 777 transitions. Word has length 1823 [2018-02-04 00:23:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:23:53,195 INFO L432 AbstractCegarLoop]: Abstraction has 694 states and 777 transitions. [2018-02-04 00:23:53,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 00:23:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 777 transitions. [2018-02-04 00:23:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1997 [2018-02-04 00:23:53,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:23:53,223 INFO L351 BasicCegarLoop]: trace histogram [153, 153, 132, 132, 132, 132, 132, 132, 132, 132, 132, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:23:53,223 INFO L371 AbstractCegarLoop]: === Iteration 41 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:23:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1767490169, now seen corresponding path program 16 times [2018-02-04 00:23:53,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:23:53,224 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:23:53,224 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:53,225 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:23:53,225 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:23:53,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:23:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 111410 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 109898 trivial. 0 not checked. [2018-02-04 00:23:57,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:23:57,391 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:23:57,396 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:23:57,690 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:23:57,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:23:57,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:23:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 111410 backedges. 53084 proven. 184 refuted. 0 times theorem prover too weak. 58142 trivial. 0 not checked. [2018-02-04 00:23:58,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:23:58,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 45 [2018-02-04 00:23:58,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 00:23:58,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 00:23:58,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=1571, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 00:23:58,823 INFO L87 Difference]: Start difference. First operand 694 states and 777 transitions. Second operand 45 states. [2018-02-04 00:23:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:23:59,331 INFO L93 Difference]: Finished difference Result 1956 states and 2355 transitions. [2018-02-04 00:23:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 00:23:59,331 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1996 [2018-02-04 00:23:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:23:59,336 INFO L225 Difference]: With dead ends: 1956 [2018-02-04 00:23:59,336 INFO L226 Difference]: Without dead ends: 1956 [2018-02-04 00:23:59,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2050 GetRequests, 1976 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1064, Invalid=4636, Unknown=0, NotChecked=0, Total=5700 [2018-02-04 00:23:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2018-02-04 00:23:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 769. [2018-02-04 00:23:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-02-04 00:23:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 857 transitions. [2018-02-04 00:23:59,349 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 857 transitions. Word has length 1996 [2018-02-04 00:23:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:23:59,349 INFO L432 AbstractCegarLoop]: Abstraction has 769 states and 857 transitions. [2018-02-04 00:23:59,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 00:23:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 857 transitions. [2018-02-04 00:23:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2183 [2018-02-04 00:23:59,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:23:59,368 INFO L351 BasicCegarLoop]: trace histogram [175, 161, 153, 153, 153, 153, 153, 139, 139, 139, 139, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:23:59,369 INFO L371 AbstractCegarLoop]: === Iteration 42 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 00:23:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash 959573400, now seen corresponding path program 17 times [2018-02-04 00:23:59,369 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:23:59,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:23:59,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:59,370 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:23:59,370 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:23:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:23:59,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:24:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 136310 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 134649 trivial. 0 not checked. [2018-02-04 00:24:04,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:24:04,537 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:24:04,542 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown