java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:57:30,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:57:30,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:57:30,502 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:57:30,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:57:30,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:57:30,503 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:57:30,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:57:30,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:57:30,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:57:30,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:57:30,507 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:57:30,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:57:30,509 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:57:30,510 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:57:30,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:57:30,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:57:30,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:57:30,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:57:30,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:57:30,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:57:30,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:57:30,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:57:30,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:57:30,519 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:57:30,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:57:30,520 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:57:30,521 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:57:30,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:57:30,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:57:30,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:57:30,521 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:57:30,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:57:30,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:57:30,531 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:57:30,531 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:57:30,531 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:57:30,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:57:30,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:57:30,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:57:30,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:57:30,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:57:30,533 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:57:30,533 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:57:30,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:57:30,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:57:30,533 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:57:30,534 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:57:30,534 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:57:30,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:57:30,572 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:57:30,575 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:57:30,576 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:57:30,576 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:57:30,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-02-02 18:57:30,726 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:57:30,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:57:30,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:57:30,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:57:30,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:57:30,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbd5d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30, skipping insertion in model container [2018-02-02 18:57:30,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,747 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:57:30,775 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:57:30,865 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:57:30,881 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:57:30,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30 WrapperNode [2018-02-02 18:57:30,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:57:30,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:57:30,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:57:30,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:57:30,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (1/1) ... [2018-02-02 18:57:30,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:57:30,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:57:30,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:57:30,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:57:30,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (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 18:57:30,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:57:30,953 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:57:30,953 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 18:57:30,953 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:57:30,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:57:30,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:57:30,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:57:30,955 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:57:31,321 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:57:31,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:57:31 BoogieIcfgContainer [2018-02-02 18:57:31,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:57:31,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:57:31,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:57:31,325 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:57:31,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:57:30" (1/3) ... [2018-02-02 18:57:31,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d077ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:57:31, skipping insertion in model container [2018-02-02 18:57:31,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:57:30" (2/3) ... [2018-02-02 18:57:31,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d077ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:57:31, skipping insertion in model container [2018-02-02 18:57:31,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:57:31" (3/3) ... [2018-02-02 18:57:31,328 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-02-02 18:57:31,336 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:57:31,343 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 18:57:31,375 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:57:31,375 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:57:31,376 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:57:31,376 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:57:31,376 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:57:31,376 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:57:31,376 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:57:31,376 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:57:31,377 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:57:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-02-02 18:57:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:57:31,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:31,399 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:31,399 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-02-02 18:57:31,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:31,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:31,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:31,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:31,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:31,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:31,539 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 18:57:31,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:31,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:31,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:57:31,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:57:31,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:57:31,558 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-02-02 18:57:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:31,830 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-02-02 18:57:31,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:57:31,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:57:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:31,839 INFO L225 Difference]: With dead ends: 161 [2018-02-02 18:57:31,839 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 18:57:31,841 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 18:57:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 18:57:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-02-02 18:57:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 18:57:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-02 18:57:31,876 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-02-02 18:57:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:31,877 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-02 18:57:31,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:57:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-02 18:57:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 18:57:31,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:31,877 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:31,878 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-02-02 18:57:31,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:31,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:31,879 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:31,880 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:31,880 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:31,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:31,953 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 18:57:31,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:31,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:31,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:57:31,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:57:31,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:57:31,956 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-02-02 18:57:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:32,081 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-02 18:57:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:57:32,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 18:57:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:32,085 INFO L225 Difference]: With dead ends: 126 [2018-02-02 18:57:32,085 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 18:57:32,086 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 18:57:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 18:57:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 18:57:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:57:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 18:57:32,094 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-02-02 18:57:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:32,094 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 18:57:32,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:57:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 18:57:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:57:32,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:32,095 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:32,095 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:32,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-02-02 18:57:32,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:32,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:32,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:32,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:32,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:32,138 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 18:57:32,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:32,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:32,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:57:32,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:57:32,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:57:32,139 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-02-02 18:57:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:32,280 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-02-02 18:57:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:57:32,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 18:57:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:32,281 INFO L225 Difference]: With dead ends: 136 [2018-02-02 18:57:32,281 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 18:57:32,282 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 18:57:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 18:57:32,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-02-02 18:57:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 18:57:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-02-02 18:57:32,288 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-02-02 18:57:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:32,288 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-02-02 18:57:32,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:57:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-02-02 18:57:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:57:32,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:32,289 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:32,289 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:32,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-02-02 18:57:32,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:32,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:32,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:32,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:32,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:32,351 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 18:57:32,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:32,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:32,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:57:32,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:57:32,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:57:32,352 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-02-02 18:57:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:32,439 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 18:57:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:57:32,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 18:57:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:32,440 INFO L225 Difference]: With dead ends: 126 [2018-02-02 18:57:32,440 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 18:57:32,440 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 18:57:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 18:57:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 18:57:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:57:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 18:57:32,444 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-02-02 18:57:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:32,444 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 18:57:32,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:57:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 18:57:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:57:32,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:32,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:32,445 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-02-02 18:57:32,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:32,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:32,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:32,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:32,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:32,499 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 18:57:32,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:32,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:32,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:57:32,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:57:32,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:57:32,500 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-02-02 18:57:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:32,579 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 18:57:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:57:32,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 18:57:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:32,580 INFO L225 Difference]: With dead ends: 119 [2018-02-02 18:57:32,580 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 18:57:32,580 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 18:57:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 18:57:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 18:57:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 18:57:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 18:57:32,585 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-02-02 18:57:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:32,585 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 18:57:32,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:57:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 18:57:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:57:32,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:32,586 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:32,586 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-02-02 18:57:32,586 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:32,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:32,587 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:32,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:32,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:32,645 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 18:57:32,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:32,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:32,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:57:32,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:57:32,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:57:32,646 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 18:57:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:32,712 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 18:57:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:57:32,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 18:57:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:32,713 INFO L225 Difference]: With dead ends: 114 [2018-02-02 18:57:32,713 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 18:57:32,713 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 18:57:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 18:57:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 18:57:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:57:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 18:57:32,717 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-02-02 18:57:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:32,718 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 18:57:32,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:57:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 18:57:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:57:32,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:32,719 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:32,719 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-02-02 18:57:32,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:32,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:32,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,720 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:32,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:32,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:32,846 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 18:57:32,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:32,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:57:32,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:57:32,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:57:32,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:57:32,847 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states. [2018-02-02 18:57:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:33,092 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2018-02-02 18:57:33,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:57:33,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 18:57:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:33,094 INFO L225 Difference]: With dead ends: 177 [2018-02-02 18:57:33,094 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 18:57:33,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:57:33,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 18:57:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2018-02-02 18:57:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 18:57:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-02-02 18:57:33,100 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21 [2018-02-02 18:57:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:33,100 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-02-02 18:57:33,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:57:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-02-02 18:57:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 18:57:33,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:33,101 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:33,101 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times [2018-02-02 18:57:33,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:33,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:33,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:33,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:33,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:33,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:33,285 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 18:57:33,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:33,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:57:33,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:57:33,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:57:33,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:57:33,286 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states. [2018-02-02 18:57:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:33,481 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-02-02 18:57:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:57:33,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 18:57:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:33,482 INFO L225 Difference]: With dead ends: 187 [2018-02-02 18:57:33,482 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 18:57:33,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:57:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 18:57:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2018-02-02 18:57:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 18:57:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-02-02 18:57:33,486 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21 [2018-02-02 18:57:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:33,486 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-02-02 18:57:33,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:57:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-02-02 18:57:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 18:57:33,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:33,487 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 18:57:33,487 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times [2018-02-02 18:57:33,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:33,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:33,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:33,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:33,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:33,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:33,687 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 18:57:33,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:33,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 18:57:33,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:57:33,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:57:33,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:57:33,688 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 13 states. [2018-02-02 18:57:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:34,545 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2018-02-02 18:57:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:57:34,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 18:57:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:34,547 INFO L225 Difference]: With dead ends: 228 [2018-02-02 18:57:34,547 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 18:57:34,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:57:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 18:57:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171. [2018-02-02 18:57:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 18:57:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-02-02 18:57:34,552 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30 [2018-02-02 18:57:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:34,552 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-02-02 18:57:34,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:57:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-02-02 18:57:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:57:34,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:34,553 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:34,553 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times [2018-02-02 18:57:34,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:34,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:34,554 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:34,555 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:34,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:34,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:34,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:34,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 18:57:34,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:57:34,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:57:34,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:57:34,896 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 13 states. [2018-02-02 18:57:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:35,346 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2018-02-02 18:57:35,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:57:35,346 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 18:57:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:35,348 INFO L225 Difference]: With dead ends: 176 [2018-02-02 18:57:35,348 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 18:57:35,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 18:57:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 18:57:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-02-02 18:57:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 18:57:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-02-02 18:57:35,352 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32 [2018-02-02 18:57:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:35,352 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-02-02 18:57:35,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:57:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-02-02 18:57:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 18:57:35,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:35,353 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] [2018-02-02 18:57:35,353 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times [2018-02-02 18:57:35,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:35,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:35,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:35,354 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:35,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:35,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:35,381 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 18:57:35,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:57:35,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:57:35,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:57:35,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:57:35,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:57:35,383 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states. [2018-02-02 18:57:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:35,439 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-02-02 18:57:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:57:35,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-02-02 18:57:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:35,441 INFO L225 Difference]: With dead ends: 155 [2018-02-02 18:57:35,441 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 18:57:35,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:57:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 18:57:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-02-02 18:57:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 18:57:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-02-02 18:57:35,445 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40 [2018-02-02 18:57:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:35,445 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-02-02 18:57:35,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:57:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-02-02 18:57:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:57:35,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:35,446 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:35,446 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times [2018-02-02 18:57:35,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:35,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:35,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:35,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:35,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:35,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:35,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:57:35,664 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:57:35,678 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:35,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:57:35,766 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|))) is different from true [2018-02-02 18:57:35,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:35,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:35,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:57:35,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:35,806 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 18:57:35,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-02 18:57:35,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-02 18:57:35,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:35,863 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 18:57:35,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-02-02 18:57:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-02 18:57:35,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:57:35,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-02-02 18:57:35,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:57:35,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:57:35,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2018-02-02 18:57:35,937 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 18 states. [2018-02-02 18:57:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:36,564 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-02-02 18:57:36,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:57:36,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-02-02 18:57:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:36,565 INFO L225 Difference]: With dead ends: 177 [2018-02-02 18:57:36,566 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 18:57:36,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=440, Unknown=1, NotChecked=44, Total=600 [2018-02-02 18:57:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 18:57:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2018-02-02 18:57:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 18:57:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-02-02 18:57:36,569 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 43 [2018-02-02 18:57:36,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:36,570 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-02-02 18:57:36,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:57:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-02-02 18:57:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:57:36,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:36,571 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:57:36,571 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244566, now seen corresponding path program 1 times [2018-02-02 18:57:36,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:36,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:36,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:36,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:36,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:36,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:37,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:57:37,073 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:57:37,078 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:37,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:57:37,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:37,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-02 18:57:37,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:37,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:37,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:37,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:57:37,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:37,240 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 18:57:37,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:30 [2018-02-02 18:57:37,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:37,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:37,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:37,326 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 16 treesize of output 13 [2018-02-02 18:57:37,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:37,399 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 19 treesize of output 30 [2018-02-02 18:57:37,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:37,409 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 18:57:37,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:33 [2018-02-02 18:57:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:37,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:57:37,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-02 18:57:37,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 18:57:37,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 18:57:37,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=293, Unknown=3, NotChecked=0, Total=342 [2018-02-02 18:57:37,489 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 19 states. [2018-02-02 18:57:38,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:38,934 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-02 18:57:38,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:57:38,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-02-02 18:57:38,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:38,935 INFO L225 Difference]: With dead ends: 167 [2018-02-02 18:57:38,935 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 18:57:38,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=504, Unknown=4, NotChecked=0, Total=600 [2018-02-02 18:57:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 18:57:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 137. [2018-02-02 18:57:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 18:57:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-02-02 18:57:38,939 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 43 [2018-02-02 18:57:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:38,939 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-02-02 18:57:38,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 18:57:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-02-02 18:57:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:57:38,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:38,940 INFO L351 BasicCegarLoop]: trace histogram [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 18:57:38,941 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 570613669, now seen corresponding path program 1 times [2018-02-02 18:57:38,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:38,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:38,941 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:38,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:38,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:38,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:39,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:57:39,537 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:57:39,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:39,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:57:39,640 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 12 treesize of output 11 [2018-02-02 18:57:39,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:39,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:39,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 18:57:39,883 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 18:57:39,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 10 treesize of output 9 [2018-02-02 18:57:39,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:39,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:39,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:39,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-02 18:57:39,941 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 23 treesize of output 35 [2018-02-02 18:57:39,945 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 18:57:39,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:39,964 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 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 18:57:39,964 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:57:39,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:57:39,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:57:39,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-02-02 18:57:40,076 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-02-02 18:57:40,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,080 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 61 treesize of output 76 [2018-02-02 18:57:40,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2018-02-02 18:57:40,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:57:40,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:57:40,166 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 33 treesize of output 28 [2018-02-02 18:57:40,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,168 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 18 treesize of output 27 [2018-02-02 18:57:40,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,192 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 3 xjuncts. [2018-02-02 18:57:40,192 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-02-02 18:57:40,271 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:57:40,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,292 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 17 treesize of output 10 [2018-02-02 18:57:40,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:57:40,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-02-02 18:57:40,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:40,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 [2018-02-02 18:57:40,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,564 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 1 xjuncts. [2018-02-02 18:57:40,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-02-02 18:57:40,714 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 77 treesize of output 75 [2018-02-02 18:57:40,716 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 12 treesize of output 1 [2018-02-02 18:57:40,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,733 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 18:57:40,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:82 [2018-02-02 18:57:40,833 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 75 treesize of output 73 [2018-02-02 18:57:40,836 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 18:57:40,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:57:40,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-02-02 18:57:40,911 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 75 treesize of output 73 [2018-02-02 18:57:40,913 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 18:57:40,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:40,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 18:57:40,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-02-02 18:57:41,000 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-02-02 18:57:41,002 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 18:57:41,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:41,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:41,012 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 15 treesize of output 8 [2018-02-02 18:57:41,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:41,019 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:41,019 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 33 treesize of output 21 [2018-02-02 18:57:41,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:41,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:41,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:57:41,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-02-02 18:57:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:41,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:57:41,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2018-02-02 18:57:41,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 18:57:41,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 18:57:41,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 18:57:41,100 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 42 states. [2018-02-02 18:57:43,366 WARN L146 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 97 DAG size of output 69 [2018-02-02 18:57:43,648 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 106 DAG size of output 72 [2018-02-02 18:57:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:57:44,712 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-02-02 18:57:44,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 18:57:44,712 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2018-02-02 18:57:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:57:44,713 INFO L225 Difference]: With dead ends: 198 [2018-02-02 18:57:44,713 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 18:57:44,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=663, Invalid=4739, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 18:57:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 18:57:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 143. [2018-02-02 18:57:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 18:57:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 18:57:44,717 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 50 [2018-02-02 18:57:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:57:44,717 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 18:57:44,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 18:57:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 18:57:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:57:44,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:57:44,718 INFO L351 BasicCegarLoop]: trace histogram [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 18:57:44,718 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:57:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash 570613670, now seen corresponding path program 1 times [2018-02-02 18:57:44,718 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:57:44,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:57:44,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:44,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:44,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:57:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:44,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:57:45,185 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 31 DAG size of output 29 [2018-02-02 18:57:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:45,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:57:45,484 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:57:45,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:57:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:57:45,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:57:45,566 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 12 treesize of output 11 [2018-02-02 18:57:45,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-02 18:57:45,647 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 18:57:45,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-02 18:57:45,727 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 18:57:45,729 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 18:57:45,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,741 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 18:57:45,743 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 18:57:45,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,762 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 18:57:45,762 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-02-02 18:57:45,811 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 23 treesize of output 53 [2018-02-02 18:57:45,815 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 36 treesize of output 35 [2018-02-02 18:57:45,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,836 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 2 case distinctions, treesize of input 33 treesize of output 48 [2018-02-02 18:57:45,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:57:45,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:57:45,871 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 47 treesize of output 57 [2018-02-02 18:57:45,874 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 48 treesize of output 47 [2018-02-02 18:57:45,874 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,896 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:45,898 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-02 18:57:45,900 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:45,900 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 38 treesize of output 29 [2018-02-02 18:57:45,901 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,904 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:45,927 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 2 xjuncts. [2018-02-02 18:57:45,927 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:66, output treesize:110 [2018-02-02 18:57:45,983 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:57:45,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,014 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 135 [2018-02-02 18:57:46,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,018 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 139 treesize of output 166 [2018-02-02 18:57:46,019 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,077 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 2 case distinctions, treesize of input 122 treesize of output 144 [2018-02-02 18:57:46,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 18:57:46,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:57:46,174 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 147 treesize of output 147 [2018-02-02 18:57:46,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,177 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 140 treesize of output 167 [2018-02-02 18:57:46,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,243 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 153 [2018-02-02 18:57:46,244 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 18:57:46,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:57:46,279 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 112 treesize of output 93 [2018-02-02 18:57:46,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,284 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:46,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 54 [2018-02-02 18:57:46,286 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,298 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:57:46,355 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:249, output treesize:210 [2018-02-02 18:57:46,430 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:57:46,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,468 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 17 treesize of output 10 [2018-02-02 18:57:46,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:57:46,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:226, output treesize:150 [2018-02-02 18:57:46,691 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 37 treesize of output 26 [2018-02-02 18:57:46,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:46,724 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 18:57:46,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,742 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 18:57:46,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:144 [2018-02-02 18:57:46,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 150 [2018-02-02 18:57:46,925 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 141 treesize of output 129 [2018-02-02 18:57:46,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:46,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 146 [2018-02-02 18:57:47,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 18:57:47,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:57:47,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 119 [2018-02-02 18:57:47,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 78 [2018-02-02 18:57:47,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 152 [2018-02-02 18:57:47,280 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 152 treesize of output 140 [2018-02-02 18:57:47,280 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 146 [2018-02-02 18:57:47,337 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-02 18:57:47,373 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:57:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 119 [2018-02-02 18:57:47,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 78 [2018-02-02 18:57:47,385 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,397 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 18:57:47,437 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:174, output treesize:323 [2018-02-02 18:57:47,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 116 [2018-02-02 18:57:47,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,581 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 30 treesize of output 51 [2018-02-02 18:57:47,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2018-02-02 18:57:47,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,738 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 24 treesize of output 39 [2018-02-02 18:57:47,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 116 [2018-02-02 18:57:47,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:47,867 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 30 treesize of output 51 [2018-02-02 18:57:47,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:47,894 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:48,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 196 [2018-02-02 18:57:48,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:48,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 221 [2018-02-02 18:57:48,330 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-02 18:57:48,517 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 167 treesize of output 166 [2018-02-02 18:57:48,518 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:48,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:57:48,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2018-02-02 18:57:48,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:48,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:48,779 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:48,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-02-02 18:57:48,781 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:48,798 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:48,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173 [2018-02-02 18:57:48,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:48,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 207 [2018-02-02 18:57:48,830 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-02-02 18:57:48,967 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 163 treesize of output 162 [2018-02-02 18:57:48,968 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:49,057 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:57:49,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 127 [2018-02-02 18:57:49,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:49,065 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:49,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2018-02-02 18:57:49,067 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:49,083 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:49,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 118 [2018-02-02 18:57:49,214 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:49,215 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 24 treesize of output 39 [2018-02-02 18:57:49,215 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:49,230 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:49,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-02-02 18:57:49,325 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:401, output treesize:529 [2018-02-02 18:57:49,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 186 [2018-02-02 18:57:49,516 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 177 treesize of output 176 [2018-02-02 18:57:49,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:49,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:50,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 138 [2018-02-02 18:57:50,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:50,222 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 63 [2018-02-02 18:57:50,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:50,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:50,726 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:50,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 138 [2018-02-02 18:57:50,729 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 36 treesize of output 21 [2018-02-02 18:57:50,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:50,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 141 [2018-02-02 18:57:51,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:51,103 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 63 [2018-02-02 18:57:51,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,261 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 141 [2018-02-02 18:57:51,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:51,539 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 63 [2018-02-02 18:57:51,539 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 131 [2018-02-02 18:57:51,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:51,786 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 63 [2018-02-02 18:57:51,787 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,800 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 128 [2018-02-02 18:57:51,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:51,966 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 63 [2018-02-02 18:57:51,966 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:51,978 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,104 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:52,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-02-02 18:57:52,107 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 36 treesize of output 21 [2018-02-02 18:57:52,107 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,115 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 173 [2018-02-02 18:57:52,249 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 173 treesize of output 172 [2018-02-02 18:57:52,249 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,306 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 128 [2018-02-02 18:57:52,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:52,413 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 63 [2018-02-02 18:57:52,413 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,427 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 10 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-02-02 18:57:52,542 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 17 variables, input treesize:791, output treesize:661 [2018-02-02 18:57:52,710 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 153 treesize of output 134 [2018-02-02 18:57:52,712 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:52,712 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 63 treesize of output 47 [2018-02-02 18:57:52,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:52,728 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 27 treesize of output 20 [2018-02-02 18:57:52,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 93 [2018-02-02 18:57:52,790 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:52,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-02-02 18:57:52,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,801 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 18:57:52,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,809 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,852 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 63 treesize of output 56 [2018-02-02 18:57:52,854 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:52,854 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 25 treesize of output 17 [2018-02-02 18:57:52,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,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, 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 18:57:52,865 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-02-02 18:57:52,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:52,942 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 23 treesize of output 16 [2018-02-02 18:57:52,942 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:52,955 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:52,955 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 24 treesize of output 16 [2018-02-02 18:57:52,956 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,001 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,043 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 153 treesize of output 134 [2018-02-02 18:57:53,047 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:53,048 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 63 treesize of output 47 [2018-02-02 18:57:53,048 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:53,064 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 27 treesize of output 20 [2018-02-02 18:57:53,064 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,077 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2018-02-02 18:57:53,117 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:57:53,117 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 46 treesize of output 30 [2018-02-02 18:57:53,118 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:57:53,136 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 15 treesize of output 8 [2018-02-02 18:57:53,136 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,143 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:57:53,163 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 15 variables, input treesize:418, output treesize:14 [2018-02-02 18:57:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:57:53,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:57:53,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2018-02-02 18:57:53,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 18:57:53,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 18:57:53,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 18:57:53,227 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 41 states. [2018-02-02 18:57:59,169 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 120 DAG size of output 108 [2018-02-02 18:58:00,064 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 227 DAG size of output 94 [2018-02-02 18:58:00,419 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 193 DAG size of output 73 [2018-02-02 18:58:00,711 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 232 DAG size of output 99 [2018-02-02 18:58:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:58:02,198 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-02-02 18:58:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 18:58:02,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-02-02 18:58:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:58:02,200 INFO L225 Difference]: With dead ends: 195 [2018-02-02 18:58:02,200 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 18:58:02,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=529, Invalid=4301, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 18:58:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 18:58:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2018-02-02 18:58:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 18:58:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 18:58:02,206 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 50 [2018-02-02 18:58:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:58:02,206 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 18:58:02,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 18:58:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 18:58:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 18:58:02,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:58:02,207 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-02-02 18:58:02,207 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:58:02,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1254680052, now seen corresponding path program 1 times [2018-02-02 18:58:02,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:58:02,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:58:02,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:02,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:02,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:02,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:58:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:58:02,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:58:02,864 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:58:02,870 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:02,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:58:02,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:02,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:02,907 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 18:58:02,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-02 18:58:02,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:58:02,966 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 18:58:02,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 18:58:02,974 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 18:58:02,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:02,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-02-02 18:58:03,003 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 26 treesize of output 21 [2018-02-02 18:58:03,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,009 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 18:58:03,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,024 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 26 treesize of output 21 [2018-02-02 18:58:03,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,029 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 18:58:03,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:60, output treesize:42 [2018-02-02 18:58:03,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:03,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:03,228 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 18:58:03,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:03,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:03,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69 [2018-02-02 18:58:03,438 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (append_~node~0.base Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_2)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse4 append_~node~0.base))))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0)))) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|) (= |c_#memory_$Pointer$.offset| (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_4)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse4 append_~node~0.offset))))) (store .cse5 append_~node~0.base (store (store (select .cse5 append_~node~0.base) .cse1 0) .cse2 0))))))) is different from true [2018-02-02 18:58:03,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,456 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 17 treesize of output 21 [2018-02-02 18:58:03,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-02-02 18:58:03,613 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 18:58:03,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,749 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 67 [2018-02-02 18:58:03,753 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 13 treesize of output 16 [2018-02-02 18:58:03,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,758 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 18:58:03,758 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,822 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 58 treesize of output 65 [2018-02-02 18:58:03,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-02 18:58:03,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,845 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 27 treesize of output 58 [2018-02-02 18:58:03,845 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,892 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:03,919 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 18:58:03,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-02-02 18:58:03,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2018-02-02 18:58:03,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:03,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 18:58:03,969 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:04,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,032 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 40 treesize of output 44 [2018-02-02 18:58:04,032 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,069 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:58:04,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2018-02-02 18:58:04,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,178 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 18:58:04,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 18:58:04,198 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,216 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,231 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2018-02-02 18:58:04,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,246 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 18:58:04,284 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:58:04,284 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 18:58:04,410 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:04,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,491 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 18:58:04,502 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,585 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:04,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 79 [2018-02-02 18:58:04,591 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,649 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:04,710 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:04,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-02-02 18:58:04,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-02-02 18:58:04,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:04,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 18:58:04,736 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,748 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,765 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:04,950 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:58:05,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:58:05,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-02-02 18:58:05,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 18:58:05,346 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,386 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 67 [2018-02-02 18:58:05,389 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 13 treesize of output 16 [2018-02-02 18:58:05,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,392 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 16 treesize of output 23 [2018-02-02 18:58:05,392 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,398 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,427 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 58 treesize of output 65 [2018-02-02 18:58:05,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-02-02 18:58:05,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,437 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 23 treesize of output 46 [2018-02-02 18:58:05,437 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,444 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,455 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,466 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2018-02-02 18:58:05,493 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 43 treesize of output 46 [2018-02-02 18:58:05,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,497 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 40 treesize of output 44 [2018-02-02 18:58:05,497 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 18:58:05,543 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:05,573 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:58:05,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2018-02-02 18:58:05,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 18:58:05,653 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:58:05,653 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:05,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:05,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 18:58:05,862 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:06,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,008 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:06,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 18:58:06,012 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 18:58:06,058 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,093 INFO L267 ElimStorePlain]: Start of recursive call 40: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:06,126 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:06,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2018-02-02 18:58:06,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 18:58:06,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 18:58:06,154 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,166 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,177 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2018-02-02 18:58:06,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-02-02 18:58:06,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:06,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 18:58:06,204 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,217 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,232 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:06,327 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:58:06,413 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 18:58:06,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 26 dim-0 vars, and 13 xjuncts. [2018-02-02 18:58:06,620 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 9 variables, input treesize:205, output treesize:1434 [2018-02-02 18:58:09,468 WARN L146 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 375 DAG size of output 43 [2018-02-02 18:58:09,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,579 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 16 treesize of output 13 [2018-02-02 18:58:09,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,591 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 1 xjuncts. [2018-02-02 18:58:09,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:81 [2018-02-02 18:58:09,703 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 50 treesize of output 59 [2018-02-02 18:58:09,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 18:58:09,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,741 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 50 treesize of output 59 [2018-02-02 18:58:09,743 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 12 treesize of output 1 [2018-02-02 18:58:09,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:09,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:111, output treesize:73 [2018-02-02 18:58:09,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-02 18:58:09,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,819 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 18 treesize of output 10 [2018-02-02 18:58:09,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,826 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 15 treesize of output 8 [2018-02-02 18:58:09,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-02 18:58:09,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,840 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 18 treesize of output 10 [2018-02-02 18:58:09,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:09,847 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 15 treesize of output 8 [2018-02-02 18:58:09,847 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:09,853 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:87, output treesize:7 [2018-02-02 18:58:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:58:09,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:58:09,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 39 [2018-02-02 18:58:09,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 18:58:09,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 18:58:09,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1276, Unknown=12, NotChecked=72, Total=1482 [2018-02-02 18:58:09,955 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 39 states. [2018-02-02 18:58:11,575 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-02-02 18:58:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:58:15,090 INFO L93 Difference]: Finished difference Result 237 states and 255 transitions. [2018-02-02 18:58:15,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:58:15,090 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-02-02 18:58:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:58:15,091 INFO L225 Difference]: With dead ends: 237 [2018-02-02 18:58:15,091 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 18:58:15,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=358, Invalid=2907, Unknown=45, NotChecked=112, Total=3422 [2018-02-02 18:58:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 18:58:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 167. [2018-02-02 18:58:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 18:58:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-02-02 18:58:15,095 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 52 [2018-02-02 18:58:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:58:15,096 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-02-02 18:58:15,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 18:58:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-02-02 18:58:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:58:15,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:58:15,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:58:15,097 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:58:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1222988087, now seen corresponding path program 1 times [2018-02-02 18:58:15,097 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:58:15,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:58:15,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:15,098 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:15,098 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:15,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:58:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:58:15,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:58:15,949 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:58:15,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:15,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:58:16,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,009 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 18:58:16,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:58:16,070 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 18:58:16,072 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 18:58:16,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,079 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 18:58:16,080 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 18:58:16,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-02-02 18:58:16,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:16,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:16,198 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 18:58:16,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:16,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:16,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:69 [2018-02-02 18:58:16,412 WARN L1033 $PredicateComparison]: unable to prove that (exists ((append_~head.offset Int) (append_~node~0.offset Int) (v_DerPreprocessor_8 Int) (v_DerPreprocessor_6 Int) (append_~node~0.base Int)) (let ((.cse1 (+ append_~node~0.offset 1)) (.cse2 (+ append_~node~0.offset 5)) (.cse4 (+ append_~head.offset 4))) (and (= 0 (select |c_old(#valid)| append_~node~0.base)) (= (store |c_old(#valid)| append_~node~0.base 1) |c_#valid|) (= (let ((.cse0 (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.base)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_8)))) (store .cse3 |c_append_#in~head.base| (store (store (select .cse3 |c_append_#in~head.base|) append_~head.offset append_~node~0.base) .cse4 append_~node~0.base))))) (store .cse0 append_~node~0.base (store (store (select .cse0 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.base|) (= (let ((.cse5 (let ((.cse6 (store |c_old(#memory_$Pointer$.offset)| append_~node~0.base (store (select |c_old(#memory_$Pointer$.offset)| append_~node~0.base) append_~node~0.offset v_DerPreprocessor_6)))) (store .cse6 |c_append_#in~head.base| (store (store (select .cse6 |c_append_#in~head.base|) append_~head.offset append_~node~0.offset) .cse4 append_~node~0.offset))))) (store .cse5 append_~node~0.base (store (store (select .cse5 append_~node~0.base) .cse1 0) .cse2 0))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-02-02 18:58:16,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,445 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 17 treesize of output 21 [2018-02-02 18:58:16,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-02-02 18:58:16,558 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 18:58:16,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-02-02 18:58:16,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2018-02-02 18:58:16,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 18:58:16,705 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:16,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,748 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 40 treesize of output 44 [2018-02-02 18:58:16,748 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:58:16,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-02-02 18:58:16,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-02-02 18:58:16,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 18:58:16,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,900 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,911 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:16,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-02-02 18:58:16,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 18:58:16,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:16,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2018-02-02 18:58:16,983 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:17,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,115 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,115 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:17,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 79 [2018-02-02 18:58:17,128 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 18:58:17,197 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,259 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:17,313 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:17,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-02-02 18:58:17,323 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 18:58:17,336 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 18:58:17,345 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,360 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,372 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:58:17,545 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 52 treesize of output 60 [2018-02-02 18:58:17,548 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 13 treesize of output 16 [2018-02-02 18:58:17,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 18:58:17,636 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,646 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,684 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 51 treesize of output 58 [2018-02-02 18:58:17,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-02 18:58:17,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:17,701 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 27 treesize of output 58 [2018-02-02 18:58:17,701 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,715 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,736 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,756 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:17,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 18:58:18,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-02-02 18:58:18,312 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 18:58:18,312 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,371 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 52 treesize of output 60 [2018-02-02 18:58:18,374 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 13 treesize of output 16 [2018-02-02 18:58:18,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,379 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 16 treesize of output 23 [2018-02-02 18:58:18,379 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,386 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,418 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 51 treesize of output 58 [2018-02-02 18:58:18,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-02-02 18:58:18,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,426 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,428 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 23 treesize of output 46 [2018-02-02 18:58:18,429 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,436 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,448 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,463 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-02-02 18:58:18,487 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 43 treesize of output 46 [2018-02-02 18:58:18,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2018-02-02 18:58:18,504 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:18,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,558 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 40 treesize of output 44 [2018-02-02 18:58:18,559 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,602 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 18:58:18,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2018-02-02 18:58:18,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 18:58:18,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 85 [2018-02-02 18:58:18,681 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,744 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,755 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2018-02-02 18:58:18,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 61 [2018-02-02 18:58:18,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 74 [2018-02-02 18:58:18,819 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:18,886 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,889 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:18,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 74 [2018-02-02 18:58:18,894 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:18,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:18,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 78 [2018-02-02 18:58:19,006 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:19,050 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:19,090 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-02-02 18:58:19,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-02-02 18:58:19,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-02-02 18:58:19,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:19,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-02-02 18:58:19,124 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:19,135 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:19,154 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:19,214 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-02 18:58:19,289 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-02-02 18:58:19,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 12 xjuncts. [2018-02-02 18:58:19,451 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 9 variables, input treesize:194, output treesize:1187 [2018-02-02 18:58:49,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:49,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:49,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:49,366 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 16 treesize of output 13 [2018-02-02 18:58:49,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,378 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 1 xjuncts. [2018-02-02 18:58:49,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:73 [2018-02-02 18:58:49,525 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 43 treesize of output 52 [2018-02-02 18:58:49,527 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 12 treesize of output 1 [2018-02-02 18:58:49,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,561 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 43 treesize of output 52 [2018-02-02 18:58:49,564 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 12 treesize of output 1 [2018-02-02 18:58:49,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:49,591 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:65 [2018-02-02 18:58:49,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-02 18:58:49,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:49,728 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 15 treesize of output 8 [2018-02-02 18:58:49,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,733 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:49,734 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 15 treesize of output 11 [2018-02-02 18:58:49,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-02-02 18:58:49,750 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:49,750 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 15 treesize of output 11 [2018-02-02 18:58:49,750 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:49,757 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 15 treesize of output 8 [2018-02-02 18:58:49,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:49,765 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:86, output treesize:7 [2018-02-02 18:58:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:58:49,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:58:49,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 44 [2018-02-02 18:58:49,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 18:58:49,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 18:58:49,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1656, Unknown=13, NotChecked=82, Total=1892 [2018-02-02 18:58:49,897 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 44 states. [2018-02-02 18:58:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:58:55,200 INFO L93 Difference]: Finished difference Result 229 states and 245 transitions. [2018-02-02 18:58:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:58:55,200 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-02-02 18:58:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:58:55,201 INFO L225 Difference]: With dead ends: 229 [2018-02-02 18:58:55,201 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 18:58:55,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=412, Invalid=3698, Unknown=54, NotChecked=126, Total=4290 [2018-02-02 18:58:55,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 18:58:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 169. [2018-02-02 18:58:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 18:58:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 185 transitions. [2018-02-02 18:58:55,205 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 185 transitions. Word has length 54 [2018-02-02 18:58:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:58:55,205 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 185 transitions. [2018-02-02 18:58:55,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 18:58:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2018-02-02 18:58:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 18:58:55,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:58:55,207 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:58:55,207 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:58:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash -848788785, now seen corresponding path program 1 times [2018-02-02 18:58:55,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:58:55,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:58:55,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:55,207 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:55,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:55,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:58:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 18:58:55,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:58:55,287 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:58:55,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:55,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:58:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 18:58:55,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:58:55,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-02 18:58:55,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:58:55,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:58:55,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:58:55,368 INFO L87 Difference]: Start difference. First operand 169 states and 185 transitions. Second operand 5 states. [2018-02-02 18:58:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:58:55,386 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2018-02-02 18:58:55,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:58:55,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-02-02 18:58:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:58:55,388 INFO L225 Difference]: With dead ends: 200 [2018-02-02 18:58:55,388 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 18:58:55,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:58:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 18:58:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2018-02-02 18:58:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 18:58:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2018-02-02 18:58:55,392 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 58 [2018-02-02 18:58:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:58:55,393 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2018-02-02 18:58:55,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:58:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2018-02-02 18:58:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 18:58:55,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:58:55,393 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-02-02 18:58:55,394 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 18:58:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash 258761966, now seen corresponding path program 1 times [2018-02-02 18:58:55,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:58:55,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:58:55,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:55,395 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:55,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:58:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:55,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:58:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:58:56,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:58:56,191 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:58:56,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:58:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:58:56,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:58:56,443 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 12 treesize of output 11 [2018-02-02 18:58:56,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:56,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:56,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-02-02 18:58:56,767 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 18:58:56,769 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 18:58:56,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:56,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:56,779 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 18:58:56,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-02 18:58:56,860 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 23 treesize of output 35 [2018-02-02 18:58:56,870 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 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 18:58:56,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:56,894 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 20 treesize of output 19 [2018-02-02 18:58:56,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:56,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:58:56,923 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 2 xjuncts. [2018-02-02 18:58:56,924 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-02-02 18:58:57,044 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 71 [2018-02-02 18:58:57,047 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,047 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 67 treesize of output 82 [2018-02-02 18:58:57,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2018-02-02 18:58:57,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 18:58:57,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:58:57,166 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 41 treesize of output 36 [2018-02-02 18:58:57,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,169 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 18 treesize of output 27 [2018-02-02 18:58:57,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-02 18:58:57,203 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-02-02 18:58:57,447 WARN L143 SmtUtils]: Spent 180ms on a formula simplification that was a NOOP. DAG size: 61 [2018-02-02 18:58:57,453 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:58:57,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,470 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 17 treesize of output 10 [2018-02-02 18:58:57,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:57,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-02-02 18:58:57,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:57,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 [2018-02-02 18:58:57,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,650 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 1 xjuncts. [2018-02-02 18:58:57,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-02-02 18:58:57,763 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 77 treesize of output 75 [2018-02-02 18:58:57,765 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 12 treesize of output 1 [2018-02-02 18:58:57,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,791 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 18:58:57,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85 [2018-02-02 18:58:57,853 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 75 treesize of output 73 [2018-02-02 18:58:57,855 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 18:58:57,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:57,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-02-02 18:58:57,926 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 75 treesize of output 73 [2018-02-02 18:58:57,928 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 18:58:57,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:57,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:57,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-02-02 18:58:58,062 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-02-02 18:58:58,064 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:58:58,065 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 33 treesize of output 21 [2018-02-02 18:58:58,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:58,074 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 18:58:58,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:58,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:58:58,081 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 15 treesize of output 8 [2018-02-02 18:58:58,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:58:58,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:58:58,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:58:58,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-02-02 18:58:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:58:58,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:58:58,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2018-02-02 18:58:58,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 18:58:58,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 18:58:58,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2085, Unknown=14, NotChecked=0, Total=2256 [2018-02-02 18:58:58,164 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand 48 states. [2018-02-02 18:59:02,197 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 134 DAG size of output 49 Received shutdown request... [2018-02-02 18:59:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:59:03,249 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:59:03,258 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:59:03,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:59:03 BoogieIcfgContainer [2018-02-02 18:59:03,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:59:03,260 INFO L168 Benchmark]: Toolchain (without parser) took 92532.56 ms. Allocated memory was 402.1 MB in the beginning and 852.5 MB in the end (delta: 450.4 MB). Free memory was 359.0 MB in the beginning and 469.0 MB in the end (delta: -110.0 MB). Peak memory consumption was 340.4 MB. Max. memory is 5.3 GB. [2018-02-02 18:59:03,261 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:59:03,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.36 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:59:03,262 INFO L168 Benchmark]: Boogie Preprocessor took 29.77 ms. Allocated memory is still 402.1 MB. Free memory was 348.4 MB in the beginning and 345.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:59:03,262 INFO L168 Benchmark]: RCFGBuilder took 402.34 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 310.6 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:59:03,262 INFO L168 Benchmark]: TraceAbstraction took 91935.85 ms. Allocated memory was 402.1 MB in the beginning and 852.5 MB in the end (delta: 450.4 MB). Free memory was 308.0 MB in the beginning and 469.0 MB in the end (delta: -161.0 MB). Peak memory consumption was 289.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:59:03,263 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.13 ms. Allocated memory is still 402.1 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.36 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 348.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.77 ms. Allocated memory is still 402.1 MB. Free memory was 348.4 MB in the beginning and 345.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 402.34 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 310.6 MB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 91935.85 ms. Allocated memory was 402.1 MB in the beginning and 852.5 MB in the end (delta: 450.4 MB). Free memory was 308.0 MB in the beginning and 469.0 MB in the end (delta: -161.0 MB). Peak memory consumption was 289.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 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (183states) and interpolant automaton (currently 32 states, 48 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 77 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 131 locations, 55 error locations. TIMEOUT Result, 91.8s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 32.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1598 SDtfs, 4760 SDslu, 10253 SDs, 0 SdLazy, 12180 SolverSat, 965 SolverUnsat, 160 SolverUnknown, 0 SolverNotchecked, 20.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 849 GetRequests, 334 SyntacticMatches, 49 SemanticMatches, 465 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5744 ImplicationChecksByTransitivity, 52.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=18, 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.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 498 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 57.6s InterpolantComputationTime, 1068 NumberOfCodeBlocks, 1068 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1041 ConstructedInterpolants, 158 QuantifiedInterpolants, 1269182 SizeOfPredicates, 122 NumberOfNonLiveVariables, 2193 ConjunctsInSsa, 366 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 46/202 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/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-59-03-272.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-59-03-272.csv Completed graceful shutdown