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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:21:24,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:21:24,321 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:21:24,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:21:24,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:21:24,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:21:24,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:21:24,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:21:24,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:21:24,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:21:24,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:21:24,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:21:24,340 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:21:24,341 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:21:24,342 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:21:24,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:21:24,346 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:21:24,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:21:24,349 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:21:24,350 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:21:24,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:21:24,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:21:24,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:21:24,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:21:24,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:21:24,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:21:24,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:21:24,355 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:21:24,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:21:24,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:21:24,356 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:21:24,356 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 13:21:24,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:21:24,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:21:24,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:21:24,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:21:24,366 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:21:24,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:21:24,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:21:24,367 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:21:24,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:21:24,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:21:24,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:21:24,368 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:21:24,368 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:21:24,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:21:24,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:21:24,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:21:24,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:21:24,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:21:24,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:21:24,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:21:24,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:21:24,369 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:21:24,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:21:24,369 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:21:24,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:21:24,408 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:21:24,411 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:21:24,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:21:24,412 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:21:24,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-02-04 13:21:24,547 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:21:24,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:21:24,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:21:24,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:21:24,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:21:24,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd77ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24, skipping insertion in model container [2018-02-04 13:21:24,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,571 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:21:24,600 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:21:24,687 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:21:24,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:21:24,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24 WrapperNode [2018-02-04 13:21:24,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:21:24,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:21:24,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:21:24,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:21:24,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (1/1) ... [2018-02-04 13:21:24,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:21:24,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:21:24,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:21:24,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:21:24,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (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 13:21:24,764 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:21:24,764 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:21:24,764 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 13:21:24,764 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:21:24,764 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:21:24,764 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:21:24,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:21:24,764 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:21:24,764 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:21:24,764 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:21:24,765 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:21:24,765 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:21:24,765 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 13:21:24,765 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:21:24,765 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:21:24,765 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:21:24,914 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:21:24,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:21:24 BoogieIcfgContainer [2018-02-04 13:21:24,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:21:24,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:21:24,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:21:24,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:21:24,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:21:24" (1/3) ... [2018-02-04 13:21:24,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500ef5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:21:24, skipping insertion in model container [2018-02-04 13:21:24,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:21:24" (2/3) ... [2018-02-04 13:21:24,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500ef5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:21:24, skipping insertion in model container [2018-02-04 13:21:24,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:21:24" (3/3) ... [2018-02-04 13:21:24,919 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-02-04 13:21:24,923 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:21:24,928 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 13:21:24,958 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:21:24,958 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:21:24,958 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:21:24,958 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:21:24,959 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:21:24,959 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:21:24,959 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:21:24,959 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:21:24,959 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:21:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-02-04 13:21:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 13:21:24,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:24,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:24,974 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-02-04 13:21:24,978 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:24,979 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:25,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:25,073 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 13:21:25,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:25,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:21:25,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 13:21:25,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 13:21:25,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 13:21:25,089 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-02-04 13:21:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:25,101 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-02-04 13:21:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 13:21:25,102 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 13:21:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:25,108 INFO L225 Difference]: With dead ends: 59 [2018-02-04 13:21:25,108 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 13:21:25,109 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 13:21:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 13:21:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 13:21:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 13:21:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 13:21:25,193 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-02-04 13:21:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:25,193 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 13:21:25,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 13:21:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 13:21:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:21:25,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:25,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:25,194 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:25,194 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-02-04 13:21:25,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:25,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:25,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:25,261 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 13:21:25,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:25,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:25,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:21:25,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:21:25,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:21:25,263 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-02-04 13:21:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:25,339 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-02-04 13:21:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:21:25,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 13:21:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:25,341 INFO L225 Difference]: With dead ends: 55 [2018-02-04 13:21:25,341 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 13:21:25,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 13:21:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 13:21:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 13:21:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 13:21:25,346 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-02-04 13:21:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:25,346 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 13:21:25,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:21:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 13:21:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:21:25,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:25,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:25,347 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-02-04 13:21:25,347 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:25,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:25,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:25,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:25,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:21:25,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:21:25,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:21:25,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:25,426 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-02-04 13:21:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:25,500 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-02-04 13:21:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:25,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:21:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:25,501 INFO L225 Difference]: With dead ends: 54 [2018-02-04 13:21:25,501 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 13:21:25,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 13:21:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 13:21:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:21:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-04 13:21:25,505 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-02-04 13:21:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:25,505 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-04 13:21:25,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:21:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-04 13:21:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:21:25,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:25,506 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] [2018-02-04 13:21:25,506 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-02-04 13:21:25,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:25,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:25,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:25,572 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 13:21:25,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:25,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:21:25,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:21:25,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:21:25,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:21:25,573 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-02-04 13:21:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:25,610 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 13:21:25,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:25,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 13:21:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:25,611 INFO L225 Difference]: With dead ends: 51 [2018-02-04 13:21:25,611 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 13:21:25,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 13:21:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 13:21:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 13:21:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 13:21:25,614 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-02-04 13:21:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:25,614 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 13:21:25,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:21:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 13:21:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:21:25,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:25,614 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] [2018-02-04 13:21:25,614 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-02-04 13:21:25,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:25,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:25,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:25,725 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 13:21:25,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:25,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:21:25,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:21:25,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:21:25,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:25,726 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-02-04 13:21:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:25,789 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 13:21:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:21:25,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 13:21:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:25,791 INFO L225 Difference]: With dead ends: 61 [2018-02-04 13:21:25,791 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 13:21:25,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:21:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 13:21:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-02-04 13:21:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 13:21:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 13:21:25,794 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-02-04 13:21:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:25,795 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 13:21:25,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:21:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 13:21:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:21:25,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:25,795 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:25,796 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-02-04 13:21:25,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:25,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:25,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:25,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:25,873 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 13:21:25,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:25,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:25,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:21:25,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 13:21:25,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:21:25,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:21:25,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:25,967 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 9 states. [2018-02-04 13:21:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:26,065 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-04 13:21:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:21:26,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 13:21:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:26,067 INFO L225 Difference]: With dead ends: 92 [2018-02-04 13:21:26,067 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 13:21:26,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:21:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 13:21:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-02-04 13:21:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 13:21:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-02-04 13:21:26,071 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-02-04 13:21:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:26,072 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-02-04 13:21:26,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:21:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-02-04 13:21:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 13:21:26,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:26,073 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:26,073 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-02-04 13:21:26,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:26,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:26,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,074 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:26,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:26,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:26,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:26,205 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 13:21:26,210 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:26,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:26,243 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 13:21:26,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:26,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:26,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 13:21:26,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 15 [2018-02-04 13:21:26,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:26,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:26,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-04 13:21:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:26,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:26,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 13:21:26,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:21:26,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:21:26,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:21:26,398 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 13 states. [2018-02-04 13:21:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:26,719 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-02-04 13:21:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:21:26,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 13:21:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:26,720 INFO L225 Difference]: With dead ends: 111 [2018-02-04 13:21:26,721 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 13:21:26,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:21:26,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 13:21:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-02-04 13:21:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 13:21:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-02-04 13:21:26,725 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-02-04 13:21:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:26,725 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-02-04 13:21:26,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:21:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-02-04 13:21:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:21:26,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:26,726 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:26,726 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-02-04 13:21:26,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:26,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:26,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:26,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:26,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:26,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:26,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:26,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:21:26,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:21:26,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:21:26,759 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-02-04 13:21:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:26,781 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-02-04 13:21:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:26,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 13:21:26,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:26,782 INFO L225 Difference]: With dead ends: 77 [2018-02-04 13:21:26,782 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 13:21:26,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 13:21:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 13:21:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 13:21:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 13:21:26,785 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-02-04 13:21:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:26,786 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 13:21:26,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:21:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 13:21:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:21:26,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:26,786 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:26,786 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-02-04 13:21:26,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:26,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:26,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:26,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:26,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:26,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:26,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:21:26,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:21:26,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:21:26,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:21:26,871 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-02-04 13:21:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:26,974 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-02-04 13:21:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:21:26,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 13:21:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:26,975 INFO L225 Difference]: With dead ends: 76 [2018-02-04 13:21:26,975 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 13:21:26,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 13:21:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 13:21:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 13:21:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-04 13:21:26,979 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-02-04 13:21:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:26,980 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-04 13:21:26,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:21:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-04 13:21:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 13:21:26,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:26,981 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:26,981 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:26,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-02-04 13:21:26,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:26,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:26,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,982 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:26,982 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:26,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:27,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:27,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:21:27,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:21:27,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:21:27,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:21:27,022 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-02-04 13:21:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:27,077 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-04 13:21:27,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:21:27,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-04 13:21:27,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:27,078 INFO L225 Difference]: With dead ends: 90 [2018-02-04 13:21:27,078 INFO L226 Difference]: Without dead ends: 90 [2018-02-04 13:21:27,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:21:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-04 13:21:27,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-02-04 13:21:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:21:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 13:21:27,082 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-02-04 13:21:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:27,082 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 13:21:27,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:21:27,082 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 13:21:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 13:21:27,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:27,083 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:27,083 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-02-04 13:21:27,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:27,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:27,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:27,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:27,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:27,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:27,152 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 13:21:27,160 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:21:27,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:21:27,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:27,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:27,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:27,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-02-04 13:21:27,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:21:27,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:21:27,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:21:27,232 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2018-02-04 13:21:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:27,398 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-04 13:21:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:21:27,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 13:21:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:27,399 INFO L225 Difference]: With dead ends: 136 [2018-02-04 13:21:27,399 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 13:21:27,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:21:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 13:21:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-02-04 13:21:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 13:21:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-04 13:21:27,403 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-02-04 13:21:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:27,403 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-04 13:21:27,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:21:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-04 13:21:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:21:27,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:27,404 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:27,405 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-02-04 13:21:27,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:27,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:27,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,406 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:27,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:27,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:27,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:27,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:21:27,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:21:27,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:21:27,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:21:27,466 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-02-04 13:21:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:27,496 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-04 13:21:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:21:27,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 13:21:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:27,500 INFO L225 Difference]: With dead ends: 107 [2018-02-04 13:21:27,500 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 13:21:27,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 13:21:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-04 13:21:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 13:21:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 13:21:27,504 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-02-04 13:21:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:27,504 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 13:21:27,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:21:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 13:21:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:21:27,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:27,505 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:27,505 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-02-04 13:21:27,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:27,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:27,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,506 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:27,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:27,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:27,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:27,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 13:21:27,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 13:21:27,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 13:21:27,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:21:27,580 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-02-04 13:21:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:27,705 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 13:21:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 13:21:27,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 13:21:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:27,706 INFO L225 Difference]: With dead ends: 105 [2018-02-04 13:21:27,706 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 13:21:27,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:21:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 13:21:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-04 13:21:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:21:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-04 13:21:27,710 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-02-04 13:21:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:27,710 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-04 13:21:27,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 13:21:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-04 13:21:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:21:27,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:27,711 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:27,711 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-02-04 13:21:27,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:27,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:27,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:27,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:27,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:27,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:27,956 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 13:21:27,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:27,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:28,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-02-04 13:21:28,005 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 15 treesize of output 3 [2018-02-04 13:21:28,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 13:21:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:28,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:21:28,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2018-02-04 13:21:28,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 13:21:28,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 13:21:28,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:21:28,032 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 16 states. [2018-02-04 13:21:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:28,312 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-02-04 13:21:28,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 13:21:28,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-02-04 13:21:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:28,313 INFO L225 Difference]: With dead ends: 113 [2018-02-04 13:21:28,313 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 13:21:28,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:21:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 13:21:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-02-04 13:21:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 13:21:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 13:21:28,316 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-02-04 13:21:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:28,316 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 13:21:28,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 13:21:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 13:21:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:21:28,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:28,317 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:28,317 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-02-04 13:21:28,318 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:28,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:28,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:28,318 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:28,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:28,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 13:21:28,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:28,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:21:28,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:21:28,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:21:28,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:28,494 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-02-04 13:21:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:28,584 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2018-02-04 13:21:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:21:28,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 13:21:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:28,585 INFO L225 Difference]: With dead ends: 113 [2018-02-04 13:21:28,585 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 13:21:28,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:21:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 13:21:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-02-04 13:21:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 13:21:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-04 13:21:28,588 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-02-04 13:21:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:28,588 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-04 13:21:28,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:21:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-04 13:21:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 13:21:28,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:28,589 INFO L351 BasicCegarLoop]: trace histogram [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 13:21:28,589 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-02-04 13:21:28,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:28,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:28,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:28,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:28,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:28,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 13:21:28,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:28,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 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 13:21:28,685 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:21:28,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 13:21:28,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:28,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:28,707 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 13:21:28,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,711 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 13:21:28,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 13:21:28,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:28,746 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 16 treesize of output 19 [2018-02-04 13:21:28,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:28,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:28,758 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 13:21:28,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:28,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 13:21:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 13:21:28,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:28,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-02-04 13:21:28,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:21:28,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:21:28,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:21:28,928 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 14 states. [2018-02-04 13:21:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:29,188 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-02-04 13:21:29,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:21:29,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-02-04 13:21:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:29,189 INFO L225 Difference]: With dead ends: 107 [2018-02-04 13:21:29,189 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 13:21:29,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-02-04 13:21:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 13:21:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-02-04 13:21:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 13:21:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-04 13:21:29,191 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-02-04 13:21:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:29,192 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-04 13:21:29,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:21:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-04 13:21:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:21:29,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:29,192 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:29,192 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:29,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-02-04 13:21:29,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:29,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:29,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,193 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:29,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:29,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:21:29,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:29,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:21:29,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:21:29,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:21:29,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:29,342 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-02-04 13:21:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:29,494 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-04 13:21:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:21:29,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-02-04 13:21:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:29,494 INFO L225 Difference]: With dead ends: 104 [2018-02-04 13:21:29,494 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 13:21:29,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:21:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 13:21:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 13:21:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:21:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-04 13:21:29,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-02-04 13:21:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:29,497 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-04 13:21:29,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:21:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-04 13:21:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 13:21:29,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:29,498 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:29,498 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-02-04 13:21:29,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:29,498 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:29,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:29,499 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:29,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 13:21:29,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:21:29,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 13:21:29,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:21:29,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:21:29,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:21:29,551 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-02-04 13:21:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:29,601 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-02-04 13:21:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 13:21:29,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 13:21:29,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:29,602 INFO L225 Difference]: With dead ends: 77 [2018-02-04 13:21:29,602 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 13:21:29,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:21:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 13:21:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 13:21:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 13:21:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-02-04 13:21:29,604 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-02-04 13:21:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:29,604 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-02-04 13:21:29,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:21:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-02-04 13:21:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 13:21:29,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:29,604 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:29,604 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-02-04 13:21:29,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:29,605 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:29,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:29,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:29,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:21:29,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:29,649 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 13:21:29,654 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:29,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 13:21:29,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:29,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-02-04 13:21:29,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 13:21:29,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 13:21:29,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 13:21:29,708 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2018-02-04 13:21:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:29,818 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-02-04 13:21:29,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:21:29,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 13:21:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:29,819 INFO L225 Difference]: With dead ends: 102 [2018-02-04 13:21:29,819 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 13:21:29,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:21:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 13:21:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-02-04 13:21:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 13:21:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-04 13:21:29,822 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-02-04 13:21:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:29,822 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-04 13:21:29,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 13:21:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-04 13:21:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 13:21:29,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:29,822 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:29,822 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-02-04 13:21:29,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:29,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:29,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:29,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:29,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:30,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:30,319 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 13:21:30,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:30,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:30,352 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 13:21:30,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 13:21:30,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:30,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:30,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 13:21:30,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 13:21:30,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:21:30,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:21:30,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 13:21:30,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:21:30,484 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 13:21:30,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-02-04 13:21:30,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-02-04 13:21:30,683 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-02-04 13:21:30,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 30 [2018-02-04 13:21:30,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-02-04 13:21:30,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:30,716 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 19 [2018-02-04 13:21:30,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:30,732 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-02-04 13:21:30,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-02-04 13:21:30,814 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:30,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:30,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:30,815 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:30,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 81 [2018-02-04 13:21:30,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2018-02-04 13:21:30,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:30,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:13 [2018-02-04 13:21:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:30,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:30,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 34 [2018-02-04 13:21:30,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 13:21:30,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 13:21:30,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1003, Unknown=19, NotChecked=0, Total=1122 [2018-02-04 13:21:30,871 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 34 states. [2018-02-04 13:21:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:32,273 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-04 13:21:32,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 13:21:32,274 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-02-04 13:21:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:32,274 INFO L225 Difference]: With dead ends: 95 [2018-02-04 13:21:32,274 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 13:21:32,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=397, Invalid=2971, Unknown=54, NotChecked=0, Total=3422 [2018-02-04 13:21:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 13:21:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2018-02-04 13:21:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 13:21:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 13:21:32,276 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 44 [2018-02-04 13:21:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:32,276 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 13:21:32,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 13:21:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 13:21:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 13:21:32,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:32,277 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:21:32,277 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:32,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1501091225, now seen corresponding path program 2 times [2018-02-04 13:21:32,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:32,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:32,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:32,278 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:32,278 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:32,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-04 13:21:32,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:32,399 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 13:21:32,408 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:21:32,425 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:21:32,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:32,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:32,444 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 13:21:32,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:32,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:32,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 13:21:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:21:32,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:32,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-02-04 13:21:32,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 13:21:32,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 13:21:32,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-04 13:21:32,532 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 15 states. [2018-02-04 13:21:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:32,766 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-02-04 13:21:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 13:21:32,766 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 13:21:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:32,767 INFO L225 Difference]: With dead ends: 58 [2018-02-04 13:21:32,767 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 13:21:32,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-04 13:21:32,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 13:21:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 13:21:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 13:21:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-02-04 13:21:32,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 45 [2018-02-04 13:21:32,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:32,768 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-02-04 13:21:32,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 13:21:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-02-04 13:21:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 13:21:32,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:32,769 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-02-04 13:21:32,769 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:32,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2137693807, now seen corresponding path program 2 times [2018-02-04 13:21:32,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:32,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:32,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:32,769 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:32,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:32,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:33,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:33,504 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 13:21:33,509 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:21:33,523 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:21:33,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:33,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:33,533 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 13:21:33,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 13:21:33,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:33,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:33,572 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 13:21:33,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 13:21:33,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:21:33,619 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 13:21:33,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 13:21:33,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:21:33,652 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 13:21:33,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:33,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-02-04 13:21:34,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-02-04 13:21:34,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-02-04 13:21:34,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 38 [2018-02-04 13:21:34,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2018-02-04 13:21:34,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-02-04 13:21:34,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 25 [2018-02-04 13:21:34,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 40 [2018-02-04 13:21:34,111 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,118 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,127 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:34,149 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:89, output treesize:70 [2018-02-04 13:21:34,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 83 [2018-02-04 13:21:34,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:34,258 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:34,259 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:34,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 144 [2018-02-04 13:21:34,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 14 [2018-02-04 13:21:34,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:34,280 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:116, output treesize:17 [2018-02-04 13:21:34,310 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:34,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:34,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 42 [2018-02-04 13:21:34,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 13:21:34,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 13:21:34,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1544, Unknown=47, NotChecked=0, Total=1722 [2018-02-04 13:21:34,330 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 42 states. [2018-02-04 13:21:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:36,746 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-04 13:21:36,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 13:21:36,747 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 55 [2018-02-04 13:21:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:36,747 INFO L225 Difference]: With dead ends: 125 [2018-02-04 13:21:36,747 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 13:21:36,748 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=576, Invalid=5462, Unknown=124, NotChecked=0, Total=6162 [2018-02-04 13:21:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 13:21:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2018-02-04 13:21:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 13:21:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-02-04 13:21:36,760 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 55 [2018-02-04 13:21:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:36,761 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-02-04 13:21:36,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 13:21:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-02-04 13:21:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 13:21:36,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:36,763 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-02-04 13:21:36,763 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1655485324, now seen corresponding path program 3 times [2018-02-04 13:21:36,763 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:36,763 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:36,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:36,763 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:36,763 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:36,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 13:21:36,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:36,818 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 13:21:36,823 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:21:36,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 13:21:36,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:36,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:21:36,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:36,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-02-04 13:21:36,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 13:21:36,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 13:21:36,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-04 13:21:36,899 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 14 states. [2018-02-04 13:21:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:37,044 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2018-02-04 13:21:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:21:37,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-04 13:21:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:37,045 INFO L225 Difference]: With dead ends: 165 [2018-02-04 13:21:37,045 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 13:21:37,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=202, Invalid=448, Unknown=0, NotChecked=0, Total=650 [2018-02-04 13:21:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 13:21:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-02-04 13:21:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 13:21:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 13:21:37,049 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 58 [2018-02-04 13:21:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:37,049 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 13:21:37,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 13:21:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 13:21:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 13:21:37,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:37,050 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-02-04 13:21:37,050 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash 189933853, now seen corresponding path program 4 times [2018-02-04 13:21:37,051 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:37,051 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:37,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:37,051 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:37,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:37,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:21:37,229 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:37,229 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 13:21:37,234 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:21:37,250 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:21:37,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:37,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 13:21:37,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:37,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-02-04 13:21:37,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:21:37,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:21:37,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:21:37,432 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 19 states. [2018-02-04 13:21:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:37,655 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2018-02-04 13:21:37,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:21:37,655 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-04 13:21:37,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:37,655 INFO L225 Difference]: With dead ends: 131 [2018-02-04 13:21:37,655 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 13:21:37,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 13:21:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 13:21:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-02-04 13:21:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 13:21:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-02-04 13:21:37,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2018-02-04 13:21:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:37,657 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-02-04 13:21:37,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:21:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-02-04 13:21:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 13:21:37,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:37,658 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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 13:21:37,658 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1456637332, now seen corresponding path program 5 times [2018-02-04 13:21:37,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:37,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:37,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:37,658 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:37,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:37,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:38,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:38,502 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 13:21:38,507 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:21:38,541 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 13:21:38,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:38,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:38,547 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 13:21:38,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 13:21:38,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:38,590 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:38,590 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 13:21:38,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 13:21:38,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:21:38,638 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 13:21:38,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:38,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-02-04 13:21:38,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:21:38,673 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 13:21:38,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:38,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-02-04 13:21:39,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2018-02-04 13:21:39,425 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-02-04 13:21:39,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-02-04 13:21:39,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 52 [2018-02-04 13:21:39,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 64 [2018-02-04 13:21:39,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-02-04 13:21:39,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 37 [2018-02-04 13:21:39,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 45 [2018-02-04 13:21:39,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 64 [2018-02-04 13:21:39,504 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,520 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,525 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,536 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,562 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 13:21:39,562 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:103, output treesize:88 [2018-02-04 13:21:39,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 95 [2018-02-04 13:21:39,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-02-04 13:21:39,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,732 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:39,733 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:39,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:39,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 91 [2018-02-04 13:21:39,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:39,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:39,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:145, output treesize:20 [2018-02-04 13:21:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:39,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:39,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-02-04 13:21:39,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 13:21:39,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 13:21:39,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2218, Unknown=44, NotChecked=0, Total=2450 [2018-02-04 13:21:39,813 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 50 states. [2018-02-04 13:21:42,930 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 116 DAG size of output 63 [2018-02-04 13:21:43,340 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 105 DAG size of output 50 [2018-02-04 13:21:44,227 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 105 DAG size of output 74 [2018-02-04 13:21:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:45,443 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2018-02-04 13:21:45,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 13:21:45,443 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-02-04 13:21:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:45,443 INFO L225 Difference]: With dead ends: 166 [2018-02-04 13:21:45,444 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 13:21:45,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1367, Invalid=10943, Unknown=122, NotChecked=0, Total=12432 [2018-02-04 13:21:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 13:21:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-02-04 13:21:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 13:21:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-02-04 13:21:45,448 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 66 [2018-02-04 13:21:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:45,448 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-02-04 13:21:45,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 13:21:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-02-04 13:21:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 13:21:45,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:45,449 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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 13:21:45,449 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:45,449 INFO L82 PathProgramCache]: Analyzing trace with hash -590785937, now seen corresponding path program 6 times [2018-02-04 13:21:45,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:45,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:45,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:45,450 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:45,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:45,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 13:21:45,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:45,526 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 13:21:45,533 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:21:45,557 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-04 13:21:45,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:45,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 13:21:45,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:45,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-02-04 13:21:45,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:21:45,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:21:45,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:21:45,607 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 17 states. [2018-02-04 13:21:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:45,746 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-02-04 13:21:45,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:21:45,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-02-04 13:21:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:45,747 INFO L225 Difference]: With dead ends: 155 [2018-02-04 13:21:45,747 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 13:21:45,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2018-02-04 13:21:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 13:21:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 75. [2018-02-04 13:21:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 13:21:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-02-04 13:21:45,749 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 69 [2018-02-04 13:21:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:45,749 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-02-04 13:21:45,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:21:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-02-04 13:21:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 13:21:45,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:45,749 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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 13:21:45,750 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash 593728948, now seen corresponding path program 7 times [2018-02-04 13:21:45,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:45,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:45,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:45,750 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:21:45,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:45,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 33 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 13:21:45,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:45,862 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 13:21:45,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:45,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 13:21:45,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:45,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2018-02-04 13:21:45,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 13:21:45,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 13:21:45,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-04 13:21:45,947 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 19 states. [2018-02-04 13:21:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:21:46,100 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-02-04 13:21:46,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:21:46,100 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2018-02-04 13:21:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:21:46,101 INFO L225 Difference]: With dead ends: 104 [2018-02-04 13:21:46,101 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 13:21:46,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-02-04 13:21:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 13:21:46,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 13:21:46,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 13:21:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-02-04 13:21:46,102 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 74 [2018-02-04 13:21:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:21:46,102 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-02-04 13:21:46,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 13:21:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-02-04 13:21:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 13:21:46,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:21:46,103 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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 13:21:46,103 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:21:46,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1302767729, now seen corresponding path program 8 times [2018-02-04 13:21:46,103 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:21:46,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:21:46,103 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:46,103 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:21:46,104 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:21:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:21:46,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:21:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:47,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:21:47,118 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 13:21:47,123 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:21:47,141 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:21:47,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:21:47,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:21:47,214 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 13:21:47,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:21:47,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:47,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:47,249 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 13:21:47,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 13:21:47,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:21:47,291 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 13:21:47,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 13:21:47,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:21:47,319 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 13:21:47,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:47,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-02-04 13:21:49,618 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 73 DAG size of output 64 [2018-02-04 13:21:49,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 84 [2018-02-04 13:21:49,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-02-04 13:21:49,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 52 [2018-02-04 13:21:49,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 54 [2018-02-04 13:21:49,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 56 [2018-02-04 13:21:49,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-02-04 13:21:49,695 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 94 [2018-02-04 13:21:49,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-02-04 13:21:49,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 59 [2018-02-04 13:21:49,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,781 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 89 [2018-02-04 13:21:49,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:49,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 123 [2018-02-04 13:21:49,792 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,805 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,814 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,833 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:49,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2018-02-04 13:21:49,867 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 11 variables, input treesize:148, output treesize:131 [2018-02-04 13:21:50,305 WARN L143 SmtUtils]: Spent 345ms on a formula simplification that was a NOOP. DAG size: 75 [2018-02-04 13:21:52,406 WARN L143 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 80 [2018-02-04 13:21:52,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 138 [2018-02-04 13:21:52,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:21:52,429 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:52,430 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:21:52,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 249 [2018-02-04 13:21:52,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:52,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 14 [2018-02-04 13:21:52,476 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:21:52,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:52,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:21:52,485 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:197, output treesize:10 [2018-02-04 13:21:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 30 proven. 38 refuted. 44 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:21:52,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:21:52,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2018-02-04 13:21:52,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 13:21:52,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 13:21:52,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=2863, Unknown=167, NotChecked=0, Total=3422 [2018-02-04 13:21:52,571 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 59 states. [2018-02-04 13:21:55,541 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-02-04 13:21:55,905 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 81 DAG size of output 67 [2018-02-04 13:22:00,318 WARN L146 SmtUtils]: Spent 4030ms on a formula simplification. DAG size of input: 89 DAG size of output 72 [2018-02-04 13:22:04,444 WARN L146 SmtUtils]: Spent 4044ms on a formula simplification. DAG size of input: 95 DAG size of output 74 [2018-02-04 13:22:08,581 WARN L146 SmtUtils]: Spent 4061ms on a formula simplification. DAG size of input: 100 DAG size of output 77 [2018-02-04 13:22:12,823 WARN L146 SmtUtils]: Spent 4034ms on a formula simplification. DAG size of input: 83 DAG size of output 82 [2018-02-04 13:22:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:12,826 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-02-04 13:22:12,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 13:22:12,826 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 77 [2018-02-04 13:22:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:12,826 INFO L225 Difference]: With dead ends: 134 [2018-02-04 13:22:12,826 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 13:22:12,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2253 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=980, Invalid=8901, Unknown=421, NotChecked=0, Total=10302 [2018-02-04 13:22:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 13:22:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-02-04 13:22:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 13:22:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-04 13:22:12,831 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 77 [2018-02-04 13:22:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:12,831 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-04 13:22:12,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 13:22:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-04 13:22:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 13:22:12,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:12,831 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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 13:22:12,832 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:12,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1572028070, now seen corresponding path program 9 times [2018-02-04 13:22:12,832 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:12,832 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:12,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:12,832 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:12,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:12,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 62 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 13:22:12,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:12,924 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 13:22:12,931 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:22:12,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 13:22:12,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:12,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 50 proven. 30 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 13:22:13,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:13,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-02-04 13:22:13,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 13:22:13,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 13:22:13,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-04 13:22:13,047 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 18 states. [2018-02-04 13:22:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:13,180 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2018-02-04 13:22:13,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 13:22:13,180 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-02-04 13:22:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:13,181 INFO L225 Difference]: With dead ends: 190 [2018-02-04 13:22:13,181 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 13:22:13,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:22:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 13:22:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2018-02-04 13:22:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 13:22:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-04 13:22:13,183 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 81 [2018-02-04 13:22:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:13,183 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-04 13:22:13,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 13:22:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-04 13:22:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 13:22:13,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:13,183 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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 13:22:13,183 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:13,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1584152469, now seen corresponding path program 10 times [2018-02-04 13:22:13,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:13,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:13,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:13,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:13,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:13,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 13:22:13,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:13,279 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 13:22:13,284 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:22:13,298 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:22:13,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:13,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-02-04 13:22:13,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:13,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2018-02-04 13:22:13,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 13:22:13,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 13:22:13,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-02-04 13:22:13,361 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 21 states. [2018-02-04 13:22:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:13,526 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2018-02-04 13:22:13,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 13:22:13,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-02-04 13:22:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:13,527 INFO L225 Difference]: With dead ends: 99 [2018-02-04 13:22:13,527 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 13:22:13,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:22:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 13:22:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-02-04 13:22:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 13:22:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-04 13:22:13,529 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 84 [2018-02-04 13:22:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:13,530 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-04 13:22:13,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 13:22:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-04 13:22:13,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 13:22:13,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:13,530 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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 13:22:13,530 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:13,531 INFO L82 PathProgramCache]: Analyzing trace with hash -559166732, now seen corresponding path program 11 times [2018-02-04 13:22:13,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:13,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:13,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:13,531 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:13,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:13,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:22:14,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:14,686 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 13:22:14,692 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:22:14,749 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 13:22:14,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:14,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:14,861 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 13:22:14,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:14,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:14,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:22:14,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:14,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:14,910 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 13:22:14,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:14,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:14,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 13:22:14,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:22:14,962 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 13:22:14,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:14,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:14,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:22:14,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-04 13:22:14,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:22:14,999 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 13:22:14,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:15,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:15,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:15,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2018-02-04 13:22:17,604 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 73 DAG size of output 62 [2018-02-04 13:22:17,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 84 [2018-02-04 13:22:17,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2018-02-04 13:22:17,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,636 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2018-02-04 13:22:17,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 64 [2018-02-04 13:22:17,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 88 [2018-02-04 13:22:17,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 97 [2018-02-04 13:22:17,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2018-02-04 13:22:17,703 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,726 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,771 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 98 [2018-02-04 13:22:17,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 51 [2018-02-04 13:22:17,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 59 [2018-02-04 13:22:17,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 75 [2018-02-04 13:22:17,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 105 [2018-02-04 13:22:17,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:17,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 154 [2018-02-04 13:22:17,891 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,908 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,917 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,924 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,932 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,947 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:17,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 13:22:17,985 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:148, output treesize:139 [2018-02-04 13:22:18,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 139 [2018-02-04 13:22:18,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,268 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,273 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:22:18,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,278 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:22:18,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 346 [2018-02-04 13:22:18,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:18,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:18,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 54 [2018-02-04 13:22:18,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:18,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:18,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:18,341 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:212, output treesize:10 [2018-02-04 13:22:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 161 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:22:18,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:18,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 70 [2018-02-04 13:22:18,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-04 13:22:18,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-04 13:22:18,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=4469, Unknown=75, NotChecked=0, Total=4830 [2018-02-04 13:22:18,448 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 70 states. [2018-02-04 13:22:24,243 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 97 DAG size of output 67 [2018-02-04 13:22:24,746 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 112 DAG size of output 73 [2018-02-04 13:22:25,987 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 137 DAG size of output 81 [2018-02-04 13:22:26,614 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 119 DAG size of output 75 [2018-02-04 13:22:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:29,006 INFO L93 Difference]: Finished difference Result 210 states and 216 transitions. [2018-02-04 13:22:29,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 13:22:29,007 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 88 [2018-02-04 13:22:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:29,007 INFO L225 Difference]: With dead ends: 210 [2018-02-04 13:22:29,007 INFO L226 Difference]: Without dead ends: 176 [2018-02-04 13:22:29,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3408 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1367, Invalid=15390, Unknown=273, NotChecked=0, Total=17030 [2018-02-04 13:22:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-04 13:22:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-02-04 13:22:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 13:22:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2018-02-04 13:22:29,012 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 88 [2018-02-04 13:22:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:29,012 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2018-02-04 13:22:29,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-04 13:22:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2018-02-04 13:22:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 13:22:29,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:29,013 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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 13:22:29,013 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash -424693361, now seen corresponding path program 12 times [2018-02-04 13:22:29,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:29,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:29,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:29,014 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:29,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:29,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 13:22:29,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:29,124 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 13:22:29,146 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:22:29,215 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 13:22:29,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:29,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 13:22:29,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:29,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 24 [2018-02-04 13:22:29,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 13:22:29,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 13:22:29,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:22:29,309 INFO L87 Difference]: Start difference. First operand 159 states and 164 transitions. Second operand 24 states. [2018-02-04 13:22:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:29,493 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-02-04 13:22:29,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 13:22:29,493 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2018-02-04 13:22:29,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:29,494 INFO L225 Difference]: With dead ends: 185 [2018-02-04 13:22:29,494 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 13:22:29,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2018-02-04 13:22:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 13:22:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 97. [2018-02-04 13:22:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 13:22:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-02-04 13:22:29,496 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 91 [2018-02-04 13:22:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:29,496 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-02-04 13:22:29,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 13:22:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-02-04 13:22:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-04 13:22:29,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:29,496 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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 13:22:29,496 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash 355526932, now seen corresponding path program 13 times [2018-02-04 13:22:29,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:29,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:29,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:29,497 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:29,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:29,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 75 proven. 68 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 13:22:29,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:29,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 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 13:22:29,654 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:22:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:29,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 98 proven. 45 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 13:22:29,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:29,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-02-04 13:22:29,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 13:22:29,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 13:22:29,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-02-04 13:22:29,750 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 25 states. [2018-02-04 13:22:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:29,990 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-02-04 13:22:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:22:29,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2018-02-04 13:22:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:29,990 INFO L225 Difference]: With dead ends: 134 [2018-02-04 13:22:29,990 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 13:22:29,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=1204, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 13:22:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 13:22:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-02-04 13:22:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 13:22:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-02-04 13:22:29,992 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 96 [2018-02-04 13:22:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:29,992 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-02-04 13:22:29,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 13:22:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-02-04 13:22:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 13:22:29,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:29,993 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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 13:22:29,993 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1419901777, now seen corresponding path program 14 times [2018-02-04 13:22:29,993 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:29,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:29,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:29,994 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:22:29,994 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:30,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 86 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-02-04 13:22:31,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:31,053 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 13:22:31,060 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 13:22:31,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 13:22:31,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:31,091 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:31,207 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 13:22:31,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 13:22:31,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:31,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:31,247 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 13:22:31,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 13:22:31,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:22:31,294 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 13:22:31,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 13:22:31,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:22:31,324 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 13:22:31,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:31,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-02-04 13:22:33,386 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 62 [2018-02-04 13:22:37,421 WARN L146 SmtUtils]: Spent 569ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-02-04 13:22:37,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2018-02-04 13:22:37,472 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2018-02-04 13:22:37,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 57 treesize of output 66 [2018-02-04 13:22:37,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 68 [2018-02-04 13:22:37,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 70 [2018-02-04 13:22:37,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 72 [2018-02-04 13:22:37,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 74 [2018-02-04 13:22:37,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 85 [2018-02-04 13:22:37,559 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,572 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 120 [2018-02-04 13:22:37,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,670 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-02-04 13:22:37,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 59 [2018-02-04 13:22:37,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 81 [2018-02-04 13:22:37,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 111 [2018-02-04 13:22:37,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 149 [2018-02-04 13:22:37,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:37,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 25 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 204 [2018-02-04 13:22:37,715 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,757 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,774 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,788 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,799 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,809 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,828 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:37,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-02-04 13:22:37,870 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 10 variables, input treesize:162, output treesize:147 [2018-02-04 13:22:38,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 158 [2018-02-04 13:22:38,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 1 [2018-02-04 13:22:38,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:38,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,196 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:22:38,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,197 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:22:38,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:38,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 219 [2018-02-04 13:22:38,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:38,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:38,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:38,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:221, output treesize:10 [2018-02-04 13:22:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 155 refuted. 78 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:22:38,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:38,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 37] total 65 [2018-02-04 13:22:38,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 13:22:38,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 13:22:38,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3445, Unknown=99, NotChecked=0, Total=4160 [2018-02-04 13:22:38,351 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 65 states. [2018-02-04 13:22:42,108 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 78 DAG size of output 66 [2018-02-04 13:22:43,194 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 78 DAG size of output 69 [2018-02-04 13:22:43,526 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 76 DAG size of output 67 [2018-02-04 13:22:44,328 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-02-04 13:22:44,823 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-02-04 13:22:45,549 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 82 DAG size of output 73 [2018-02-04 13:22:46,106 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 82 DAG size of output 73 [2018-02-04 13:22:46,886 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 85 DAG size of output 76 [2018-02-04 13:22:47,522 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 84 DAG size of output 75 [2018-02-04 13:22:49,235 WARN L146 SmtUtils]: Spent 282ms on a formula simplification. DAG size of input: 87 DAG size of output 78 [2018-02-04 13:22:49,818 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 88 DAG size of output 79 [2018-02-04 13:22:50,681 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 123 DAG size of output 76 [2018-02-04 13:22:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:54,915 INFO L93 Difference]: Finished difference Result 234 states and 239 transitions. [2018-02-04 13:22:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-02-04 13:22:54,916 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 99 [2018-02-04 13:22:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:54,916 INFO L225 Difference]: With dead ends: 234 [2018-02-04 13:22:54,916 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 13:22:54,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8285 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=3494, Invalid=23110, Unknown=456, NotChecked=0, Total=27060 [2018-02-04 13:22:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 13:22:54,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2018-02-04 13:22:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 13:22:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 187 transitions. [2018-02-04 13:22:54,921 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 187 transitions. Word has length 99 [2018-02-04 13:22:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:54,922 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 187 transitions. [2018-02-04 13:22:54,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 13:22:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 187 transitions. [2018-02-04 13:22:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 13:22:54,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:54,923 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 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 13:22:54,923 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash -291435573, now seen corresponding path program 15 times [2018-02-04 13:22:54,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:54,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:54,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:54,924 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:54,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:54,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 84 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 13:22:55,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:55,060 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 13:22:55,065 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 13:22:55,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 13:22:55,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:55,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 98 proven. 98 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-04 13:22:55,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:22:55,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-02-04 13:22:55,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 13:22:55,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 13:22:55,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:22:55,245 INFO L87 Difference]: Start difference. First operand 182 states and 187 transitions. Second operand 28 states. [2018-02-04 13:22:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:22:55,520 INFO L93 Difference]: Finished difference Result 212 states and 218 transitions. [2018-02-04 13:22:55,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 13:22:55,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-02-04 13:22:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:22:55,521 INFO L225 Difference]: With dead ends: 212 [2018-02-04 13:22:55,521 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 13:22:55,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=489, Invalid=1673, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 13:22:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 13:22:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 108. [2018-02-04 13:22:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 13:22:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-02-04 13:22:55,524 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 106 [2018-02-04 13:22:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:22:55,525 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-02-04 13:22:55,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 13:22:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-02-04 13:22:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 13:22:55,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:22:55,525 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 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 13:22:55,526 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:22:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1890168527, now seen corresponding path program 16 times [2018-02-04 13:22:55,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:22:55,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:22:55,526 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:55,527 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:22:55,527 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:22:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:22:55,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:22:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 101 proven. 90 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 13:22:55,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:22:55,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 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 13:22:55,682 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 13:22:55,700 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 13:22:55,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:22:55,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:22:55,705 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 13:22:55,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 13:22:55,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:55,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:22:55,721 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 13:22:55,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 13:22:55,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:22:55,747 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 13:22:55,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 13:22:55,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:22:55,766 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 13:22:55,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:22:55,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-02-04 13:23:01,033 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-02-04 13:23:01,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 96 [2018-02-04 13:23:01,052 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-02-04 13:23:01,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,056 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-02-04 13:23:01,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 70 [2018-02-04 13:23:01,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2018-02-04 13:23:01,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,075 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 126 [2018-02-04 13:23:01,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 166 [2018-02-04 13:23:01,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 214 [2018-02-04 13:23:01,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,138 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 281 [2018-02-04 13:23:01,141 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,183 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,219 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,242 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,276 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 118 [2018-02-04 13:23:01,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 50 [2018-02-04 13:23:01,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2018-02-04 13:23:01,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 86 [2018-02-04 13:23:01,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 116 [2018-02-04 13:23:01,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 18 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 154 [2018-02-04 13:23:01,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 25 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 200 [2018-02-04 13:23:01,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,457 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,458 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:01,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 33 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 265 [2018-02-04 13:23:01,463 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,502 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,523 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,539 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,553 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,566 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,577 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,604 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:01,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 13:23:01,674 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:148, output treesize:152 [2018-02-04 13:23:02,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 165 [2018-02-04 13:23:02,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,184 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:23:02,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,190 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 13:23:02,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 419 [2018-02-04 13:23:02,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:02,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:02,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 224 [2018-02-04 13:23:02,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:02,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:02,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:02,308 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:238, output treesize:17 [2018-02-04 13:23:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-02-04 13:23:02,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:23:02,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 44] total 62 [2018-02-04 13:23:02,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 13:23:02,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 13:23:02,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3604, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 13:23:02,554 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 62 states. [2018-02-04 13:23:08,400 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 60 DAG size of output 58 [2018-02-04 13:23:08,769 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 59 DAG size of output 55 [2018-02-04 13:23:09,348 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 61 DAG size of output 57 [2018-02-04 13:23:09,746 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 62 DAG size of output 59 [2018-02-04 13:23:10,278 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 64 DAG size of output 62 [2018-02-04 13:23:10,685 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 64 DAG size of output 61 [2018-02-04 13:23:11,226 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 66 DAG size of output 64 [2018-02-04 13:23:11,643 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 65 DAG size of output 62 [2018-02-04 13:23:12,200 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 67 DAG size of output 65 [2018-02-04 13:23:13,129 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-02-04 13:23:13,608 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 70 DAG size of output 67 [2018-02-04 13:23:14,603 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 103 DAG size of output 70 [2018-02-04 13:23:15,675 WARN L146 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 103 DAG size of output 70 [2018-02-04 13:23:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:23:17,892 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-02-04 13:23:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 13:23:17,892 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 107 [2018-02-04 13:23:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:23:17,892 INFO L225 Difference]: With dead ends: 197 [2018-02-04 13:23:17,893 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 13:23:17,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4304 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1038, Invalid=17868, Unknown=0, NotChecked=0, Total=18906 [2018-02-04 13:23:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 13:23:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-02-04 13:23:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 13:23:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-04 13:23:17,895 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 107 [2018-02-04 13:23:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:23:17,895 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-04 13:23:17,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 13:23:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-04 13:23:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-04 13:23:17,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:23:17,895 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 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 13:23:17,895 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:23:17,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1753165917, now seen corresponding path program 17 times [2018-02-04 13:23:17,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:23:17,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:23:17,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:23:17,896 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:23:17,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:23:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:23:17,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:23:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 131 proven. 115 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 13:23:18,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:23:18,059 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 13:23:18,063 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 13:23:18,269 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-02-04 13:23:18,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:23:18,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:23:18,384 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 162 proven. 84 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 13:23:18,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:23:18,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 31 [2018-02-04 13:23:18,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 13:23:18,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 13:23:18,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:23:18,403 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 31 states. [2018-02-04 13:23:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:23:18,730 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2018-02-04 13:23:18,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 13:23:18,730 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2018-02-04 13:23:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:23:18,731 INFO L225 Difference]: With dead ends: 160 [2018-02-04 13:23:18,731 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 13:23:18,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=426, Invalid=1926, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 13:23:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 13:23:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 13:23:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 13:23:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-02-04 13:23:18,733 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 114 [2018-02-04 13:23:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:23:18,733 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-02-04 13:23:18,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 13:23:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-02-04 13:23:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 13:23:18,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:23:18,734 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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 13:23:18,734 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:23:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash 736410424, now seen corresponding path program 18 times [2018-02-04 13:23:18,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:23:18,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:23:18,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:23:18,735 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:23:18,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:23:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:23:18,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:23:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 131 proven. 129 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-04 13:23:18,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:23:18,964 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 13:23:18,969 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 13:23:19,082 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-02-04 13:23:19,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 13:23:19,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:23:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 128 proven. 132 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-02-04 13:23:19,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:23:19,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2018-02-04 13:23:19,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 13:23:19,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 13:23:19,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 13:23:19,327 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 42 states. [2018-02-04 13:23:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:23:19,901 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-02-04 13:23:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 13:23:19,902 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 117 [2018-02-04 13:23:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:23:19,902 INFO L225 Difference]: With dead ends: 124 [2018-02-04 13:23:19,902 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 13:23:19,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=677, Invalid=3355, Unknown=0, NotChecked=0, Total=4032 [2018-02-04 13:23:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 13:23:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-04 13:23:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 13:23:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-02-04 13:23:19,904 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 117 [2018-02-04 13:23:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:23:19,904 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-02-04 13:23:19,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 13:23:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-02-04 13:23:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-04 13:23:19,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:23:19,904 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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 13:23:19,904 INFO L371 AbstractCegarLoop]: === Iteration 39 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 13:23:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1776114225, now seen corresponding path program 19 times [2018-02-04 13:23:19,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:23:19,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:23:19,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:23:19,905 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 13:23:19,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:23:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:23:19,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:23:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 120 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:23:22,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:23:22,174 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 13:23:22,179 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:23:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:23:22,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:23:22,210 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 13:23:22,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 13:23:22,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:22,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 13:23:22,272 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 13:23:22,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 13:23:22,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 13:23:22,346 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 13:23:22,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 13:23:22,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-04 13:23:22,384 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 13:23:22,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:23:22,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-02-04 13:24:43,627 WARN L143 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 66 [2018-02-04 13:24:46,419 WARN L143 SmtUtils]: Spent 159ms on a formula simplification that was a NOOP. DAG size: 66 Received shutdown request... [2018-02-04 13:24:46,797 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 13:24:46,797 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 13:24:46,800 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 13:24:46,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:24:46 BoogieIcfgContainer [2018-02-04 13:24:46,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:24:46,801 INFO L168 Benchmark]: Toolchain (without parser) took 202253.85 ms. Allocated memory was 409.5 MB in the beginning and 837.8 MB in the end (delta: 428.3 MB). Free memory was 366.2 MB in the beginning and 606.0 MB in the end (delta: -239.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:24:46,802 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 409.5 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:24:46,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.19 ms. Allocated memory is still 409.5 MB. Free memory was 366.2 MB in the beginning and 355.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:24:46,802 INFO L168 Benchmark]: Boogie Preprocessor took 26.21 ms. Allocated memory is still 409.5 MB. Free memory was 355.6 MB in the beginning and 352.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:24:46,802 INFO L168 Benchmark]: RCFGBuilder took 185.76 ms. Allocated memory is still 409.5 MB. Free memory was 352.9 MB in the beginning and 333.1 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 13:24:46,802 INFO L168 Benchmark]: TraceAbstraction took 201885.96 ms. Allocated memory was 409.5 MB in the beginning and 837.8 MB in the end (delta: 428.3 MB). Free memory was 333.1 MB in the beginning and 606.0 MB in the end (delta: -272.9 MB). Peak memory consumption was 155.5 MB. Max. memory is 5.3 GB. [2018-02-04 13:24:46,803 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 409.5 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.19 ms. Allocated memory is still 409.5 MB. Free memory was 366.2 MB in the beginning and 355.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.21 ms. Allocated memory is still 409.5 MB. Free memory was 355.6 MB in the beginning and 352.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 185.76 ms. Allocated memory is still 409.5 MB. Free memory was 352.9 MB in the beginning and 333.1 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201885.96 ms. Allocated memory was 409.5 MB in the beginning and 837.8 MB in the end (delta: 428.3 MB). Free memory was 333.1 MB in the beginning and 606.0 MB in the end (delta: -272.9 MB). Peak memory consumption was 155.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 201.8s OverallTime, 39 OverallIterations, 10 TraceHistogramMax, 77.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1358 SDtfs, 7405 SDslu, 10332 SDs, 0 SdLazy, 19685 SolverSat, 2894 SolverUnsat, 1043 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2938 GetRequests, 1535 SyntacticMatches, 54 SemanticMatches, 1349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27579 ImplicationChecksByTransitivity, 83.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 574 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 3792 NumberOfCodeBlocks, 3753 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 3729 ConstructedInterpolants, 261 QuantifiedInterpolants, 3633272 SizeOfPredicates, 150 NumberOfNonLiveVariables, 5814 ConjunctsInSsa, 603 ConjunctsInUnsatCore, 63 InterpolantComputations, 15 PerfectInterpolantSequences, 3279/5956 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-24-46-808.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-24-46-808.csv Completed graceful shutdown