java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:58:10,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:58:10,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:58:10,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:58:10,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:58:10,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:58:10,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:58:10,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:58:10,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:58:10,538 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:58:10,539 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:58:10,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:58:10,540 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:58:10,541 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:58:10,542 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:58:10,544 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:58:10,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:58:10,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:58:10,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:58:10,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:58:10,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:58:10,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:58:10,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:58:10,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:58:10,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:58:10,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:58:10,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:58:10,555 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:58:10,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:58:10,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:58:10,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:58:10,556 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:58:10,566 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:58:10,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:58:10,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:58:10,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:58:10,568 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:58:10,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:58:10,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:58:10,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:58:10,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:58:10,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:58:10,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:58:10,569 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:58:10,569 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:58:10,569 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:58:10,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:58:10,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:58:10,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:58:10,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:58:10,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:58:10,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:58:10,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:58:10,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:58:10,570 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:58:10,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:58:10,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:58:10,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:58:10,617 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:58:10,620 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:58:10,622 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:58:10,622 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:58:10,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i [2018-02-02 08:58:10,781 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:58:10,782 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:58:10,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:58:10,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:58:10,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:58:10,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53eb65ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10, skipping insertion in model container [2018-02-02 08:58:10,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,799 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:58:10,825 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:58:10,913 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:58:10,928 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:58:10,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10 WrapperNode [2018-02-02 08:58:10,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:58:10,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:58:10,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:58:10,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:58:10,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... [2018-02-02 08:58:10,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:58:10,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:58:10,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:58:10,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:58:10,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:58:11,006 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:58:11,006 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:58:11,006 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 08:58:11,006 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:58:11,006 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:58:11,006 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:58:11,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 08:58:11,007 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:58:11,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:58:11,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:58:11,304 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:58:11,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:58:11 BoogieIcfgContainer [2018-02-02 08:58:11,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:58:11,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:58:11,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:58:11,308 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:58:11,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:58:10" (1/3) ... [2018-02-02 08:58:11,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29068e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:58:11, skipping insertion in model container [2018-02-02 08:58:11,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:10" (2/3) ... [2018-02-02 08:58:11,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29068e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:58:11, skipping insertion in model container [2018-02-02 08:58:11,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:58:11" (3/3) ... [2018-02-02 08:58:11,310 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_true-valid-memsafety.i [2018-02-02 08:58:11,316 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:58:11,322 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-02-02 08:58:11,347 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:58:11,347 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:58:11,348 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:58:11,348 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:58:11,348 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:58:11,348 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:58:11,348 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:58:11,348 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:58:11,349 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:58:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-02-02 08:58:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 08:58:11,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:11,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:11,370 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -473238968, now seen corresponding path program 1 times [2018-02-02 08:58:11,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:11,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:11,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:11,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:11,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:11,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:11,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:11,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:58:11,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:58:11,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:58:11,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:11,493 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2018-02-02 08:58:11,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:11,714 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-02-02 08:58:11,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:58:11,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 08:58:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:11,726 INFO L225 Difference]: With dead ends: 102 [2018-02-02 08:58:11,726 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 08:58:11,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 08:58:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-02-02 08:58:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 08:58:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-02-02 08:58:11,764 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 7 [2018-02-02 08:58:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:11,764 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-02-02 08:58:11,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:58:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-02-02 08:58:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 08:58:11,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:11,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:11,765 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:11,765 INFO L82 PathProgramCache]: Analyzing trace with hash -473238967, now seen corresponding path program 1 times [2018-02-02 08:58:11,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:11,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:11,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:11,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:11,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:11,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:11,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:11,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:58:11,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:58:11,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:58:11,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:11,817 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 3 states. [2018-02-02 08:58:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:11,896 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-02-02 08:58:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:58:11,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 08:58:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:11,898 INFO L225 Difference]: With dead ends: 98 [2018-02-02 08:58:11,898 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 08:58:11,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 08:58:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-02 08:58:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:58:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-02-02 08:58:11,907 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 7 [2018-02-02 08:58:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:11,907 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-02-02 08:58:11,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:58:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-02-02 08:58:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:58:11,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:11,909 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:11,909 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -799395641, now seen corresponding path program 1 times [2018-02-02 08:58:11,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:11,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:11,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:11,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:11,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:11,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:11,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:11,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:58:11,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:58:11,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:58:11,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:58:11,988 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 5 states. [2018-02-02 08:58:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:12,117 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-02 08:58:12,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:58:12,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 08:58:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:12,118 INFO L225 Difference]: With dead ends: 93 [2018-02-02 08:58:12,118 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 08:58:12,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:58:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 08:58:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 08:58:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 08:58:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-02 08:58:12,122 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 13 [2018-02-02 08:58:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:12,122 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-02 08:58:12,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:58:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-02 08:58:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:58:12,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:12,123 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:12,123 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash -799395640, now seen corresponding path program 1 times [2018-02-02 08:58:12,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:12,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:12,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:12,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:12,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:12,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:12,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:58:12,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:58:12,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:58:12,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:58:12,216 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-02-02 08:58:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:12,464 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-02-02 08:58:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:58:12,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-02 08:58:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:12,466 INFO L225 Difference]: With dead ends: 123 [2018-02-02 08:58:12,466 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 08:58:12,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:58:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 08:58:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-02-02 08:58:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 08:58:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-02 08:58:12,471 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 13 [2018-02-02 08:58:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:12,471 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-02 08:58:12,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:58:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-02 08:58:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:58:12,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:12,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:12,472 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash 988538978, now seen corresponding path program 1 times [2018-02-02 08:58:12,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:12,472 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:12,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:12,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:12,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:12,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:12,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:58:12,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:58:12,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:58:12,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:58:12,496 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 4 states. [2018-02-02 08:58:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:12,565 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-02-02 08:58:12,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:58:12,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:58:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:12,566 INFO L225 Difference]: With dead ends: 109 [2018-02-02 08:58:12,566 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 08:58:12,566 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-02 08:58:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 08:58:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-02 08:58:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 08:58:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-02-02 08:58:12,571 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 14 [2018-02-02 08:58:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:12,571 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-02-02 08:58:12,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:58:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-02-02 08:58:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:58:12,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:12,572 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:12,572 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash 988538979, now seen corresponding path program 1 times [2018-02-02 08:58:12,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:12,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:12,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:12,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:12,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:12,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:12,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:58:12,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:58:12,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:58:12,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:58:12,624 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 4 states. [2018-02-02 08:58:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:12,672 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-02 08:58:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:58:12,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:58:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:12,673 INFO L225 Difference]: With dead ends: 105 [2018-02-02 08:58:12,673 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 08:58:12,673 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-02 08:58:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 08:58:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-02 08:58:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 08:58:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 08:58:12,682 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 14 [2018-02-02 08:58:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:12,682 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 08:58:12,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:58:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 08:58:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:58:12,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:12,683 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:12,683 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1876114930, now seen corresponding path program 1 times [2018-02-02 08:58:12,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:12,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:12,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:12,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:12,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:12,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:12,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:58:12,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:58:12,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:58:12,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:58:12,794 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 8 states. [2018-02-02 08:58:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:12,953 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-02-02 08:58:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:58:12,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 08:58:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:12,954 INFO L225 Difference]: With dead ends: 102 [2018-02-02 08:58:12,954 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 08:58:12,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:58:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 08:58:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-02 08:58:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 08:58:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-02-02 08:58:12,959 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 19 [2018-02-02 08:58:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:12,960 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-02-02 08:58:12,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:58:12,960 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-02-02 08:58:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:58:12,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:12,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:12,961 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1075458389, now seen corresponding path program 1 times [2018-02-02 08:58:12,961 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:12,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:12,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:12,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:12,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:13,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:13,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:58:13,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:58:13,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:58:13,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:58:13,059 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 6 states. [2018-02-02 08:58:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,148 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-02-02 08:58:13,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:58:13,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 08:58:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,148 INFO L225 Difference]: With dead ends: 104 [2018-02-02 08:58:13,148 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 08:58:13,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:58:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 08:58:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-02-02 08:58:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 08:58:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-02-02 08:58:13,152 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 27 [2018-02-02 08:58:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,152 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-02-02 08:58:13,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:58:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-02-02 08:58:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:58:13,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,153 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:13,153 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130712, now seen corresponding path program 1 times [2018-02-02 08:58:13,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:13,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:13,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:58:13,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:58:13,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:58:13,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:58:13,213 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 7 states. [2018-02-02 08:58:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,328 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-02-02 08:58:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:58:13,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 08:58:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,329 INFO L225 Difference]: With dead ends: 110 [2018-02-02 08:58:13,329 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 08:58:13,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:58:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 08:58:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2018-02-02 08:58:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:58:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-02-02 08:58:13,332 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 30 [2018-02-02 08:58:13,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,332 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-02-02 08:58:13,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:58:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-02-02 08:58:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:58:13,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,333 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:13,333 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130713, now seen corresponding path program 1 times [2018-02-02 08:58:13,333 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,333 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:13,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:13,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:58:13,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:58:13,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:58:13,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:58:13,466 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 9 states. [2018-02-02 08:58:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,639 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-02 08:58:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:58:13,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-02 08:58:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,640 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:58:13,640 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 08:58:13,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:58:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 08:58:13,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2018-02-02 08:58:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:58:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-02-02 08:58:13,643 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 30 [2018-02-02 08:58:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,643 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-02-02 08:58:13,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:58:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-02-02 08:58:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:58:13,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,644 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 08:58:13,644 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1794665042, now seen corresponding path program 1 times [2018-02-02 08:58:13,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:13,748 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-02 08:58:13,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:13,749 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:13,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:13,885 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:13,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:58:13,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:13,927 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:13,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:13,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:58:13,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:13,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:13,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-02 08:58:13,969 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-02 08:58:14,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:14,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-02 08:58:14,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:58:14,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:58:14,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:58:14,003 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 13 states. [2018-02-02 08:58:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:14,279 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-02-02 08:58:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:58:14,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 08:58:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:14,280 INFO L225 Difference]: With dead ends: 92 [2018-02-02 08:58:14,280 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 08:58:14,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:58:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 08:58:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-02-02 08:58:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 08:58:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2018-02-02 08:58:14,284 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 32 [2018-02-02 08:58:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:14,284 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2018-02-02 08:58:14,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:58:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2018-02-02 08:58:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:58:14,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:14,285 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:14,285 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash 374430840, now seen corresponding path program 1 times [2018-02-02 08:58:14,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:14,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:14,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:14,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:14,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:14,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:14,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:58:14,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:58:14,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:58:14,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:58:14,340 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 5 states. [2018-02-02 08:58:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:14,400 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 08:58:14,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:58:14,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 08:58:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:14,401 INFO L225 Difference]: With dead ends: 95 [2018-02-02 08:58:14,402 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 08:58:14,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:58:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 08:58:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-02-02 08:58:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 08:58:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 08:58:14,405 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 33 [2018-02-02 08:58:14,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:14,405 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 08:58:14,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:58:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 08:58:14,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:58:14,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:14,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:14,406 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash -486325487, now seen corresponding path program 1 times [2018-02-02 08:58:14,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:14,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:14,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:14,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:14,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:14,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:14,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:58:14,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:58:14,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:58:14,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:58:14,450 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 5 states. [2018-02-02 08:58:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:14,513 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-02 08:58:14,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:58:14,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 08:58:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:14,514 INFO L225 Difference]: With dead ends: 91 [2018-02-02 08:58:14,514 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 08:58:14,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:58:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 08:58:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-02 08:58:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 08:58:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-02 08:58:14,517 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 33 [2018-02-02 08:58:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:14,517 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-02 08:58:14,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:58:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-02 08:58:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:58:14,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:14,518 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:14,518 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -486325486, now seen corresponding path program 1 times [2018-02-02 08:58:14,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:14,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:14,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:14,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:14,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:14,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:14,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:58:14,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:58:14,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:58:14,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:58:14,665 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 11 states. [2018-02-02 08:58:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:14,898 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-02-02 08:58:14,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:58:14,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-02 08:58:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:14,900 INFO L225 Difference]: With dead ends: 93 [2018-02-02 08:58:14,900 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 08:58:14,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:58:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 08:58:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-02-02 08:58:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 08:58:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-02-02 08:58:14,904 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 33 [2018-02-02 08:58:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:14,904 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-02-02 08:58:14,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:58:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-02-02 08:58:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:58:14,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:14,905 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:14,905 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:14,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779100, now seen corresponding path program 1 times [2018-02-02 08:58:14,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:14,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:14,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:14,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:14,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:15,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:15,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 08:58:15,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:58:15,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:58:15,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:58:15,152 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 15 states. [2018-02-02 08:58:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:15,772 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-02 08:58:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:58:15,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-02 08:58:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:15,773 INFO L225 Difference]: With dead ends: 128 [2018-02-02 08:58:15,773 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 08:58:15,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:58:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 08:58:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2018-02-02 08:58:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 08:58:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 08:58:15,777 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 34 [2018-02-02 08:58:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:15,778 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 08:58:15,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:58:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 08:58:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:58:15,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:15,779 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:15,779 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:15,779 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779101, now seen corresponding path program 1 times [2018-02-02 08:58:15,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:15,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:15,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:15,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:15,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:15,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:15,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:15,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 08:58:15,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:58:15,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:58:15,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:58:15,991 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 15 states. [2018-02-02 08:58:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:16,553 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-02-02 08:58:16,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:58:16,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-02 08:58:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:16,554 INFO L225 Difference]: With dead ends: 131 [2018-02-02 08:58:16,554 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 08:58:16,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:58:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 08:58:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2018-02-02 08:58:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 08:58:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-02-02 08:58:16,559 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 34 [2018-02-02 08:58:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:16,559 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-02-02 08:58:16,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:58:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-02-02 08:58:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 08:58:16,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:16,560 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:16,560 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash -950447499, now seen corresponding path program 1 times [2018-02-02 08:58:16,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:16,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:16,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:16,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:16,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:16,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:16,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:16,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:58:16,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:58:16,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:58:16,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:58:16,612 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 8 states. [2018-02-02 08:58:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:16,692 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-02 08:58:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:58:16,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-02 08:58:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:16,693 INFO L225 Difference]: With dead ends: 97 [2018-02-02 08:58:16,693 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 08:58:16,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:58:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 08:58:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-02 08:58:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 08:58:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-02-02 08:58:16,695 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 35 [2018-02-02 08:58:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:16,696 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-02-02 08:58:16,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:58:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-02-02 08:58:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 08:58:16,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:16,697 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:16,697 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1197880803, now seen corresponding path program 1 times [2018-02-02 08:58:16,697 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:16,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:16,698 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:16,698 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:16,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:16,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:17,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:17,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 08:58:17,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:58:17,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:58:17,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:58:17,011 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 15 states. [2018-02-02 08:58:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:17,592 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-02 08:58:17,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:58:17,934 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-02 08:58:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:17,935 INFO L225 Difference]: With dead ends: 140 [2018-02-02 08:58:17,935 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 08:58:17,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:58:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 08:58:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-02-02 08:58:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 08:58:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 08:58:17,939 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 36 [2018-02-02 08:58:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:17,939 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 08:58:17,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:58:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 08:58:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 08:58:17,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:17,940 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:17,940 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400791, now seen corresponding path program 1 times [2018-02-02 08:58:17,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:17,940 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:17,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:17,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:17,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:17,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:18,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:18,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:58:18,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:58:18,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:58:18,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:58:18,002 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 8 states. [2018-02-02 08:58:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:18,077 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 08:58:18,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:58:18,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-02 08:58:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:18,077 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:58:18,077 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 08:58:18,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:58:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 08:58:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 08:58:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 08:58:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 08:58:18,080 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 37 [2018-02-02 08:58:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:18,081 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 08:58:18,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:58:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 08:58:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 08:58:18,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:18,081 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:18,081 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:18,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400792, now seen corresponding path program 1 times [2018-02-02 08:58:18,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:18,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:18,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:18,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:18,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:18,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:18,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:18,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 08:58:18,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:58:18,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:58:18,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:58:18,434 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 15 states. [2018-02-02 08:58:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:18,998 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-02-02 08:58:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:58:18,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-02 08:58:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:18,999 INFO L225 Difference]: With dead ends: 123 [2018-02-02 08:58:18,999 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 08:58:19,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:58:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 08:58:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2018-02-02 08:58:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 08:58:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 08:58:19,004 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 37 [2018-02-02 08:58:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:19,004 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 08:58:19,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:58:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 08:58:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 08:58:19,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:19,005 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:19,005 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash -482433028, now seen corresponding path program 1 times [2018-02-02 08:58:19,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:19,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:19,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:19,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:19,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:19,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:19,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:19,128 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:19,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:19,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:19,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:19,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:19,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,205 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-02 08:58:19,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-02 08:58:19,256 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-02 08:58:19,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-02 08:58:19,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-02-02 08:58:19,331 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 26 treesize of output 25 [2018-02-02 08:58:19,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,348 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-02 08:58:19,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-02 08:58:19,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-02-02 08:58:19,392 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 20 treesize of output 5 [2018-02-02 08:58:19,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:19,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-02 08:58:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:19,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:19,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-02-02 08:58:19,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 08:58:19,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 08:58:19,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 08:58:19,446 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 20 states. [2018-02-02 08:58:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:19,890 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-02-02 08:58:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:58:19,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-02-02 08:58:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:19,890 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:58:19,890 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 08:58:19,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:58:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 08:58:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 08:58:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 08:58:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-02 08:58:19,893 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 38 [2018-02-02 08:58:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:19,893 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-02 08:58:19,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 08:58:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-02 08:58:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 08:58:19,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:19,894 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:19,894 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -482433027, now seen corresponding path program 1 times [2018-02-02 08:58:19,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:19,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:19,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:19,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:19,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:19,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:20,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:20,073 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:20,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:20,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:20,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:20,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:20,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:20,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:20,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-02 08:58:20,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:20,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:20,185 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 15 treesize of output 8 [2018-02-02 08:58:20,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,191 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 23 [2018-02-02 08:58:20,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-02 08:58:20,288 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-02-02 08:58:20,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 33 [2018-02-02 08:58:20,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,333 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-02-02 08:58:20,336 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 24 treesize of output 23 [2018-02-02 08:58:20,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:20,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-02 08:58:20,398 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 1 case distinctions, treesize of input 36 treesize of output 34 [2018-02-02 08:58:20,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-02-02 08:58:20,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,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 1 case distinctions, treesize of input 26 treesize of output 26 [2018-02-02 08:58:20,417 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 22 treesize of output 15 [2018-02-02 08:58:20,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,424 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 8 [2018-02-02 08:58:20,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,430 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 18 treesize of output 3 [2018-02-02 08:58:20,430 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:20,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:20,437 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-02 08:58:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:20,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:20,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-02 08:58:20,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:58:20,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:58:20,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2018-02-02 08:58:20,473 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 22 states. [2018-02-02 08:58:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:21,024 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-02-02 08:58:21,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:58:21,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-02-02 08:58:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:21,026 INFO L225 Difference]: With dead ends: 112 [2018-02-02 08:58:21,026 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 08:58:21,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056 [2018-02-02 08:58:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 08:58:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 08:58:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 08:58:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-02 08:58:21,028 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 38 [2018-02-02 08:58:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:21,028 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-02 08:58:21,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:58:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-02 08:58:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:58:21,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:21,029 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:21,029 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash 816280248, now seen corresponding path program 1 times [2018-02-02 08:58:21,029 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:21,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:21,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:21,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:21,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:21,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:21,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:21,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:58:21,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:58:21,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:58:21,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:58:21,127 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 12 states. [2018-02-02 08:58:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:21,292 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 08:58:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:58:21,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 08:58:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:21,292 INFO L225 Difference]: With dead ends: 119 [2018-02-02 08:58:21,293 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 08:58:21,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:58:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 08:58:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 08:58:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 08:58:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-02 08:58:21,296 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 39 [2018-02-02 08:58:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:21,296 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-02 08:58:21,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:58:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-02 08:58:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 08:58:21,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:21,297 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:21,297 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash -469859278, now seen corresponding path program 1 times [2018-02-02 08:58:21,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:21,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:21,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:21,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:21,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:21,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:21,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:21,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 08:58:21,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:58:21,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:58:21,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:58:21,714 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 19 states. [2018-02-02 08:58:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:22,334 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-02-02 08:58:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:58:22,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-02-02 08:58:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:22,334 INFO L225 Difference]: With dead ends: 127 [2018-02-02 08:58:22,334 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 08:58:22,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:58:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 08:58:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2018-02-02 08:58:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 08:58:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-02-02 08:58:22,337 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 44 [2018-02-02 08:58:22,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:22,337 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-02-02 08:58:22,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:58:22,337 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-02-02 08:58:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 08:58:22,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:22,337 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:22,337 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -564431953, now seen corresponding path program 1 times [2018-02-02 08:58:22,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:22,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:22,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:22,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:22,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:22,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:23,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:23,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 08:58:23,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:58:23,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:58:23,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:58:23,520 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 22 states. [2018-02-02 08:58:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:24,624 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-02 08:58:24,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:58:24,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-02-02 08:58:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:24,625 INFO L225 Difference]: With dead ends: 126 [2018-02-02 08:58:24,625 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 08:58:24,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:58:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 08:58:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-02-02 08:58:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 08:58:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-02-02 08:58:24,627 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 46 [2018-02-02 08:58:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:24,627 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-02-02 08:58:24,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:58:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-02-02 08:58:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 08:58:24,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:24,627 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:24,627 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1674895406, now seen corresponding path program 1 times [2018-02-02 08:58:24,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:24,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:24,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:24,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:24,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:24,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:24,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:24,712 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:24,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:24,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:24,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:24,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-02 08:58:24,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:24,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:24,760 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-02 08:58:24,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-02-02 08:58:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:24,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:24,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2018-02-02 08:58:24,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:58:24,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:58:24,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:58:24,848 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 17 states. [2018-02-02 08:58:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:25,238 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-02-02 08:58:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:58:25,238 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 08:58:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:25,239 INFO L225 Difference]: With dead ends: 84 [2018-02-02 08:58:25,239 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 08:58:25,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 08:58:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 08:58:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 08:58:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 08:58:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-02-02 08:58:25,241 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 53 [2018-02-02 08:58:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:25,241 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-02-02 08:58:25,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:58:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-02-02 08:58:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 08:58:25,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:25,241 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:25,241 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1337769880, now seen corresponding path program 1 times [2018-02-02 08:58:25,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:25,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:25,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:25,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:25,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:25,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:25,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:25,945 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:25,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:25,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:25,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:25,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:25,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:25,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:58:26,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 08:58:26,102 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 10 treesize of output 9 [2018-02-02 08:58:26,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-02 08:58:26,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:26,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:26,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 43 [2018-02-02 08:58:26,189 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 28 treesize of output 27 [2018-02-02 08:58:26,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-02-02 08:58:26,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,240 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 15 treesize of output 8 [2018-02-02 08:58:26,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-02-02 08:58:26,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:26,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:26,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,578 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-02 08:58:26,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-02-02 08:58:26,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-02-02 08:58:26,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,688 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 80 treesize of output 72 [2018-02-02 08:58:26,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-02-02 08:58:26,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:26,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:26,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-02-02 08:58:26,713 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 29 treesize of output 36 [2018-02-02 08:58:26,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,715 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:58:26,715 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 36 treesize of output 86 [2018-02-02 08:58:26,716 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,736 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:58:26,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 78 treesize of output 87 [2018-02-02 08:58:26,740 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 60 treesize of output 51 [2018-02-02 08:58:26,740 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:26,762 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:78 [2018-02-02 08:58:26,811 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 58 treesize of output 48 [2018-02-02 08:58:26,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-02-02 08:58:26,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,852 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-02 08:58:26,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:60 [2018-02-02 08:58:26,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-02 08:58:26,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,918 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:58:26,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-02-02 08:58:26,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,929 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 11 treesize of output 3 [2018-02-02 08:58:26,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,934 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 7 treesize of output 1 [2018-02-02 08:58:26,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,940 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-02 08:58:26,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2018-02-02 08:58:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:26,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:26,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 41 [2018-02-02 08:58:26,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 08:58:26,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 08:58:26,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 08:58:26,990 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2018-02-02 08:58:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:29,669 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-02-02 08:58:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 08:58:29,669 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2018-02-02 08:58:29,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:29,670 INFO L225 Difference]: With dead ends: 134 [2018-02-02 08:58:29,670 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 08:58:29,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=611, Invalid=6699, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 08:58:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 08:58:29,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2018-02-02 08:58:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 08:58:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-02-02 08:58:29,674 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 54 [2018-02-02 08:58:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:29,675 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-02-02 08:58:29,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 08:58:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-02-02 08:58:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 08:58:29,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:29,676 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:29,676 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1337769881, now seen corresponding path program 1 times [2018-02-02 08:58:29,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:29,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:29,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:29,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:29,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:29,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:30,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:30,760 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:30,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:30,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:30,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:30,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:58:30,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:30,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-02-02 08:58:30,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 08:58:30,947 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 10 treesize of output 9 [2018-02-02 08:58:30,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,954 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-02 08:58:30,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-02-02 08:58:30,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:30,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:30,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:30,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-02 08:58:31,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-02 08:58:31,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-02-02 08:58:31,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,063 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 15 treesize of output 8 [2018-02-02 08:58:31,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-02-02 08:58:31,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:31,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:31,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,475 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-02 08:58:31,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-02-02 08:58:31,596 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71 [2018-02-02 08:58:31,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,617 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 48 treesize of output 44 [2018-02-02 08:58:31,619 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 44 treesize of output 40 [2018-02-02 08:58:31,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-02-02 08:58:31,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-02 08:58:31,647 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 28 treesize of output 29 [2018-02-02 08:58:31,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87 [2018-02-02 08:58:31,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-02-02 08:58:31,668 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,676 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,683 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,695 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:128 [2018-02-02 08:58:31,860 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 15 treesize of output 11 [2018-02-02 08:58:31,861 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 11 treesize of output 3 [2018-02-02 08:58:31,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,875 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-02 08:58:31,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:126 [2018-02-02 08:58:31,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:31,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 76 [2018-02-02 08:58:31,948 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-02-02 08:58:31,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 08:58:31,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 35 [2018-02-02 08:58:31,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 29 [2018-02-02 08:58:31,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:31,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 52 [2018-02-02 08:58:31,995 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-02 08:58:31,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-02-02 08:58:31,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:32,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-02-02 08:58:32,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-02-02 08:58:32,080 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:127, output treesize:177 [2018-02-02 08:58:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:32,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:32,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 47 [2018-02-02 08:58:32,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 08:58:32,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 08:58:32,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2081, Unknown=1, NotChecked=0, Total=2256 [2018-02-02 08:58:32,192 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 48 states. [2018-02-02 08:58:33,308 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 104 DAG size of output 81 [2018-02-02 08:58:35,566 WARN L146 SmtUtils]: Spent 2108ms on a formula simplification. DAG size of input: 76 DAG size of output 60 [2018-02-02 08:58:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:35,965 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-02-02 08:58:35,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 08:58:35,965 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2018-02-02 08:58:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:35,966 INFO L225 Difference]: With dead ends: 84 [2018-02-02 08:58:35,966 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 08:58:35,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=414, Invalid=4415, Unknown=1, NotChecked=0, Total=4830 [2018-02-02 08:58:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 08:58:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-02-02 08:58:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 08:58:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-02-02 08:58:35,968 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 54 [2018-02-02 08:58:35,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:35,968 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-02-02 08:58:35,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 08:58:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-02-02 08:58:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 08:58:35,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:35,969 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:35,969 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:35,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1401633689, now seen corresponding path program 1 times [2018-02-02 08:58:35,969 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:35,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:35,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:35,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:35,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:35,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:36,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:36,689 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:36,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:36,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:36,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:36,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:58:36,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:36,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:36,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:58:36,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-02-02 08:58:36,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 08:58:36,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-02 08:58:36,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,879 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-02 08:58:36,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-02 08:58:36,916 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 3 case distinctions, treesize of input 20 treesize of output 32 [2018-02-02 08:58:36,922 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-02-02 08:58:36,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:58:36,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 08:58:36,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:36,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:36,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:36,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:36,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:36,971 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72 [2018-02-02 08:58:37,005 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 08:58:37,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,014 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,015 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 15 treesize of output 8 [2018-02-02 08:58:37,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45 [2018-02-02 08:58:37,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:37,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:37,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:37,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134 [2018-02-02 08:58:37,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-02 08:58:37,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,499 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 58 treesize of output 54 [2018-02-02 08:58:37,501 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 54 treesize of output 50 [2018-02-02 08:58:37,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 78 [2018-02-02 08:58:37,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-02-02 08:58:37,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,526 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 38 treesize of output 53 [2018-02-02 08:58:37,527 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,531 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-02-02 08:58:37,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-02 08:58:37,544 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,551 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,556 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,564 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:178, output treesize:110 [2018-02-02 08:58:37,773 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 111 treesize of output 95 [2018-02-02 08:58:37,775 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 95 treesize of output 76 [2018-02-02 08:58:37,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:88 [2018-02-02 08:58:37,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 57 [2018-02-02 08:58:37,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,856 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2018-02-02 08:58:37,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 08:58:37,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-02 08:58:37,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2018-02-02 08:58:37,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,873 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-02 08:58:37,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:10 [2018-02-02 08:58:37,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:37,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-02-02 08:58:37,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:37,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-02 08:58:37,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2018-02-02 08:58:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:37,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:37,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 49 [2018-02-02 08:58:37,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 08:58:37,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 08:58:37,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2286, Unknown=2, NotChecked=0, Total=2450 [2018-02-02 08:58:37,994 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 50 states. [2018-02-02 08:58:42,329 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 85 DAG size of output 73 [2018-02-02 08:58:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:43,456 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-02-02 08:58:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 08:58:43,456 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2018-02-02 08:58:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:43,457 INFO L225 Difference]: With dead ends: 131 [2018-02-02 08:58:43,457 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 08:58:43,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=602, Invalid=6367, Unknown=3, NotChecked=0, Total=6972 [2018-02-02 08:58:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 08:58:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2018-02-02 08:58:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:58:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-02-02 08:58:43,460 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 56 [2018-02-02 08:58:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:43,460 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-02-02 08:58:43,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 08:58:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-02-02 08:58:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 08:58:43,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:43,462 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:43,462 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 500971420, now seen corresponding path program 1 times [2018-02-02 08:58:43,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:43,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:43,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:43,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:43,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:43,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:44,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:44,254 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:44,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:44,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:44,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:44,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:58:44,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:44,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-02-02 08:58:44,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 08:58:44,418 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 10 treesize of output 9 [2018-02-02 08:58:44,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,431 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-02 08:58:44,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-02-02 08:58:44,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:44,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:44,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-02 08:58:44,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 21 [2018-02-02 08:58:44,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-02-02 08:58:44,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:44,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:44,527 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 15 treesize of output 8 [2018-02-02 08:58:44,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2018-02-02 08:58:44,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:44,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:44,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:44,901 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-02 08:58:44,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106 [2018-02-02 08:58:45,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-02-02 08:58:45,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,040 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:58:45,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2018-02-02 08:58:45,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-02-02 08:58:45,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,056 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 53 treesize of output 76 [2018-02-02 08:58:45,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,074 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-02-02 08:58:45,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-02-02 08:58:45,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2018-02-02 08:58:45,090 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,103 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,108 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:58:45,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-02 08:58:45,109 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2018-02-02 08:58:45,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-02-02 08:58:45,129 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 32 treesize of output 33 [2018-02-02 08:58:45,129 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,133 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75 [2018-02-02 08:58:45,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-02-02 08:58:45,152 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,161 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,184 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 26 treesize of output 24 [2018-02-02 08:58:45,185 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 3 [2018-02-02 08:58:45,186 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,189 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,190 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 64 treesize of output 60 [2018-02-02 08:58:45,191 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 25 treesize of output 21 [2018-02-02 08:58:45,192 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,197 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:45,209 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:146, output treesize:111 [2018-02-02 08:58:45,387 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 49 treesize of output 45 [2018-02-02 08:58:45,388 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 11 treesize of output 7 [2018-02-02 08:58:45,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,413 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 107 treesize of output 103 [2018-02-02 08:58:45,414 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 11 treesize of output 7 [2018-02-02 08:58:45,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:45,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:135 [2018-02-02 08:58:45,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 143 [2018-02-02 08:58:45,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-02-02 08:58:45,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 08:58:45,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:459, output treesize:257 [2018-02-02 08:58:45,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 67 [2018-02-02 08:58:45,654 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36 [2018-02-02 08:58:45,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 08:58:45,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 22 [2018-02-02 08:58:45,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-02-02 08:58:45,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 29 [2018-02-02 08:58:45,705 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 29 treesize of output 13 [2018-02-02 08:58:45,705 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 61 [2018-02-02 08:58:45,733 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2018-02-02 08:58:45,734 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 08:58:45,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-02-02 08:58:45,755 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:45,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-02 08:58:45,761 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:45,765 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:45,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 23 [2018-02-02 08:58:45,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:45,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-02 08:58:45,792 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:45,805 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:45,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-02 08:58:45,829 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:281, output treesize:61 [2018-02-02 08:58:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:45,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:45,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 50 [2018-02-02 08:58:45,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 08:58:45,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 08:58:45,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2385, Unknown=2, NotChecked=0, Total=2550 [2018-02-02 08:58:45,943 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 51 states. [2018-02-02 08:58:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:49,564 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-02-02 08:58:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 08:58:49,564 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2018-02-02 08:58:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:49,565 INFO L225 Difference]: With dead ends: 130 [2018-02-02 08:58:49,565 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 08:58:49,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=531, Invalid=6436, Unknown=5, NotChecked=0, Total=6972 [2018-02-02 08:58:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 08:58:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 97. [2018-02-02 08:58:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 08:58:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-02-02 08:58:49,569 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 57 [2018-02-02 08:58:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:49,569 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-02-02 08:58:49,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 08:58:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-02-02 08:58:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 08:58:49,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:49,570 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:49,570 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash 397197244, now seen corresponding path program 1 times [2018-02-02 08:58:49,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:49,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:49,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:49,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:49,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:49,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:49,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:49,688 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:49,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:49,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:49,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:49,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:49,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,753 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-02 08:58:49,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-02-02 08:58:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:49,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-02 08:58:49,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-02-02 08:58:49,775 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 24 treesize of output 18 [2018-02-02 08:58:49,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-02 08:58:49,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-02-02 08:58:49,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:49,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-02 08:58:49,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:49,794 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-02 08:58:49,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-02 08:58:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:49,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:58:49,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 15 [2018-02-02 08:58:49,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:58:49,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:58:49,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:58:49,837 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 16 states. [2018-02-02 08:58:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:50,164 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-02-02 08:58:50,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:58:50,165 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-02 08:58:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:50,165 INFO L225 Difference]: With dead ends: 110 [2018-02-02 08:58:50,165 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 08:58:50,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:58:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 08:58:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2018-02-02 08:58:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:58:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-02-02 08:58:50,168 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 59 [2018-02-02 08:58:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:50,168 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-02-02 08:58:50,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:58:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-02-02 08:58:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 08:58:50,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:50,169 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:50,169 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 08:58:50,169 INFO L82 PathProgramCache]: Analyzing trace with hash 68467118, now seen corresponding path program 1 times [2018-02-02 08:58:50,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:50,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:50,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:50,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:50,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:50,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:51,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:58:51,455 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:58:51,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:51,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:51,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:51,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:58:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:51,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:58:51,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-02-02 08:58:51,714 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 13 treesize of output 10 [2018-02-02 08:58:51,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-02 08:58:51,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,722 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-02 08:58:51,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-02 08:58:51,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 32 [2018-02-02 08:58:51,773 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-02-02 08:58:51,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:58:51,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 08:58:51,788 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:51,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 08:58:51,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:58:51,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:51,824 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71 [2018-02-02 08:58:51,865 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 08:58:51,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:51,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:51,872 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 15 treesize of output 8 [2018-02-02 08:58:51,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:51,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44 [2018-02-02 08:58:52,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-02 08:58:52,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,437 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:58:52,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-02-02 08:58:52,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-02-02 08:58:52,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,454 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 63 [2018-02-02 08:58:52,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 74 [2018-02-02 08:58:52,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 32 treesize of output 12 [2018-02-02 08:58:52,465 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,475 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 41 treesize of output 36 [2018-02-02 08:58:52,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-02-02 08:58:52,478 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:52,483 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:52,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:52,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 85 [2018-02-02 08:58:52,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-02-02 08:58:52,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 55 [2018-02-02 08:58:52,507 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,511 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:52,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-02-02 08:58:52,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2018-02-02 08:58:52,526 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,534 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,541 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,558 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 35 treesize of output 33 [2018-02-02 08:58:52,559 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 3 [2018-02-02 08:58:52,559 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,563 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,565 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 77 treesize of output 73 [2018-02-02 08:58:52,566 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 25 treesize of output 21 [2018-02-02 08:58:52,566 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,572 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:52,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 08:58:52,587 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 4 variables, input treesize:155, output treesize:135 [2018-02-02 08:58:53,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:53,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 102 [2018-02-02 08:58:53,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 08:58:53,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:53,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 180 [2018-02-02 08:58:53,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:58:53,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 7 xjuncts. [2018-02-02 08:58:53,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:641, output treesize:758 [2018-02-02 08:58:53,382 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 84 DAG size of output 74 [2018-02-02 08:58:53,387 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 148 treesize of output 142 [2018-02-02 08:58:53,389 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 34 treesize of output 25 [2018-02-02 08:58:53,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,493 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 180 treesize of output 170 [2018-02-02 08:58:53,494 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 75 treesize of output 62 [2018-02-02 08:58:53,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-02-02 08:58:53,614 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 34 treesize of output 25 [2018-02-02 08:58:53,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,623 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,711 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 121 treesize of output 109 [2018-02-02 08:58:53,713 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 88 treesize of output 73 [2018-02-02 08:58:53,713 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-02-02 08:58:53,806 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 36 treesize of output 27 [2018-02-02 08:58:53,806 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,815 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,896 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 150 treesize of output 144 [2018-02-02 08:58:53,898 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 36 treesize of output 27 [2018-02-02 08:58:53,898 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,909 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:53,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-02-02 08:58:53,985 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:758, output treesize:648 [2018-02-02 08:58:54,139 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 08:58:54,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:54,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 145 [2018-02-02 08:58:54,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:54,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 147 [2018-02-02 08:58:54,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:54,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 77 [2018-02-02 08:58:54,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:54,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,580 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 58 treesize of output 83 [2018-02-02 08:58:54,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:54,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 9 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-02 08:58:54,626 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:854, output treesize:325 [2018-02-02 08:58:54,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 107 [2018-02-02 08:58:54,775 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2018-02-02 08:58:54,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 08:58:54,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 08:58:54,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:54,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 117 [2018-02-02 08:58:54,928 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 117 [2018-02-02 08:58:54,930 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 08:58:54,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 08:58:55,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2018-02-02 08:58:55,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:377, output treesize:603 [2018-02-02 08:59:05,466 WARN L146 SmtUtils]: Spent 10105ms on a formula simplification. DAG size of input: 164 DAG size of output 58 [2018-02-02 08:59:05,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:59:05,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:59:05,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2018-02-02 08:59:05,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:59:05,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-02-02 08:59:05,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:59:05,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-02 08:59:05,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:59:05,494 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-02-02 08:59:05,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:59:05,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:59:05,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:59:05,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:59:05,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2018-02-02 08:59:05,519 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 13 treesize of output 5 [2018-02-02 08:59:05,519 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:59:05,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2018-02-02 08:59:05,529 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 08:59:05,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-02 08:59:05,536 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:59:05,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:59:05,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-02 08:59:05,551 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:163, output treesize:58 [2018-02-02 08:59:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:59:05,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:59:05,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 60 [2018-02-02 08:59:05,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 08:59:05,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 08:59:05,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3437, Unknown=6, NotChecked=0, Total=3660 [2018-02-02 08:59:05,663 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 61 states. Received shutdown request... [2018-02-02 08:59:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:59:08,792 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:59:08,796 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:59:08,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:59:08 BoogieIcfgContainer [2018-02-02 08:59:08,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:59:08,797 INFO L168 Benchmark]: Toolchain (without parser) took 58016.07 ms. Allocated memory was 397.9 MB in the beginning and 1.1 GB in the end (delta: 728.8 MB). Free memory was 354.4 MB in the beginning and 596.5 MB in the end (delta: -242.1 MB). Peak memory consumption was 486.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:08,798 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 397.9 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:59:08,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.48 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 343.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:08,798 INFO L168 Benchmark]: Boogie Preprocessor took 30.46 ms. Allocated memory is still 397.9 MB. Free memory was 343.8 MB in the beginning and 342.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:08,798 INFO L168 Benchmark]: RCFGBuilder took 340.54 ms. Allocated memory is still 397.9 MB. Free memory was 342.5 MB in the beginning and 312.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:08,798 INFO L168 Benchmark]: TraceAbstraction took 57491.04 ms. Allocated memory was 397.9 MB in the beginning and 1.1 GB in the end (delta: 728.8 MB). Free memory was 312.0 MB in the beginning and 596.5 MB in the end (delta: -284.5 MB). Peak memory consumption was 444.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:08,799 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.23 ms. Allocated memory is still 397.9 MB. Free memory is still 361.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.48 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 343.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.46 ms. Allocated memory is still 397.9 MB. Free memory was 343.8 MB in the beginning and 342.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 340.54 ms. Allocated memory is still 397.9 MB. Free memory was 342.5 MB in the beginning and 312.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57491.04 ms. Allocated memory was 397.9 MB in the beginning and 1.1 GB in the end (delta: 728.8 MB). Free memory was 312.0 MB in the beginning and 596.5 MB in the end (delta: -284.5 MB). Peak memory consumption was 444.3 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 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 633]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 18 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 47 error locations. TIMEOUT Result, 57.4s OverallTime, 32 OverallIterations, 2 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1718 SDtfs, 2764 SDslu, 9173 SDs, 0 SdLazy, 13305 SolverSat, 621 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1232 GetRequests, 365 SyntacticMatches, 54 SemanticMatches, 812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10689 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=24, 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, 31 MinimizatonAttempts, 302 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 1625 NumberOfCodeBlocks, 1625 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1583 ConstructedInterpolants, 57 QuantifiedInterpolants, 1926753 SizeOfPredicates, 221 NumberOfNonLiveVariables, 2450 ConjunctsInSsa, 647 ConjunctsInUnsatCore, 42 InterpolantComputations, 22 PerfectInterpolantSequences, 140/294 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/test-0232_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-59-08-804.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-59-08-804.csv Completed graceful shutdown