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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:44:43,845 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:44:43,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:44:43,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:44:43,861 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:44:43,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:44:43,863 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:44:43,864 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:44:43,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:44:43,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:44:43,868 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:44:43,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:44:43,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:44:43,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:44:43,871 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:44:43,873 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:44:43,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:44:43,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:44:43,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:44:43,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:44:43,882 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:44:43,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:44:43,882 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:44:43,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:44:43,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:44:43,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:44:43,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:44:43,886 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:44:43,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:44:43,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:44:43,887 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:44:43,887 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:44:43,895 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:44:43,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:44:43,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:44:43,897 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:44:43,897 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:44:43,897 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:44:43,897 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:44:43,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:44:43,898 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:44:43,899 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:44:43,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:44:43,899 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:44:43,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:44:43,899 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:44:43,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:44:43,899 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:44:43,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:44:43,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:44:43,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:44:43,900 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:44:43,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:44:43,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:44:43,901 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:44:43,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:44:43,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:44:43,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:44:43,902 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:44:43,902 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:44:43,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:44:43,943 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:44:43,946 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:44:43,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:44:43,970 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:44:43,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-28 21:44:44,137 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:44:44,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:44:44,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:44:44,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:44:44,146 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:44:44,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103b8d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44, skipping insertion in model container [2018-01-28 21:44:44,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,163 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:44:44,201 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:44:44,314 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:44:44,330 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:44:44,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44 WrapperNode [2018-01-28 21:44:44,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:44:44,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:44:44,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:44:44,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:44:44,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... [2018-01-28 21:44:44,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:44:44,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:44:44,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:44:44,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:44:44,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (1/1) ... No working directory specified, using /storage/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-01-28 21:44:44,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:44:44,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:44:44,442 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:44:44,442 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:44:44,443 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:44:44,444 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:44:44,444 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-28 21:44:44,444 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:44:44,444 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:44:44,444 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:44:44,444 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:44:44,825 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:44:44,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:44:44 BoogieIcfgContainer [2018-01-28 21:44:44,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:44:44,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:44:44,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:44:44,830 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:44:44,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:44:44" (1/3) ... [2018-01-28 21:44:44,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8bf32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:44:44, skipping insertion in model container [2018-01-28 21:44:44,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:44:44" (2/3) ... [2018-01-28 21:44:44,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8bf32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:44:44, skipping insertion in model container [2018-01-28 21:44:44,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:44:44" (3/3) ... [2018-01-28 21:44:44,833 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-01-28 21:44:44,842 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:44:44,850 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-28 21:44:44,895 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:44:44,895 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:44:44,895 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:44:44,895 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:44:44,895 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:44:44,896 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:44:44,896 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:44:44,896 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:44:44,897 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:44:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-01-28 21:44:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-28 21:44:44,922 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:44,923 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:44,923 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1736862064, now seen corresponding path program 1 times [2018-01-28 21:44:44,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:44,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:44,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:44,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:44,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:45,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:45,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:45,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:44:45,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-28 21:44:45,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-28 21:44:45,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 21:44:45,051 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2018-01-28 21:44:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:45,161 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2018-01-28 21:44:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-28 21:44:45,162 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-28 21:44:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:45,171 INFO L225 Difference]: With dead ends: 210 [2018-01-28 21:44:45,171 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 21:44:45,174 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 21:44:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 21:44:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-28 21:44:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 21:44:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-01-28 21:44:45,207 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 12 [2018-01-28 21:44:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:45,208 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-01-28 21:44:45,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-28 21:44:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-01-28 21:44:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 21:44:45,209 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:45,209 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:45,209 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1137446311, now seen corresponding path program 1 times [2018-01-28 21:44:45,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:45,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:45,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:45,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:45,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:45,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:45,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 21:44:45,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:44:45,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:44:45,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:44:45,262 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 3 states. [2018-01-28 21:44:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:45,385 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-01-28 21:44:45,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:44:45,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-28 21:44:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:45,387 INFO L225 Difference]: With dead ends: 140 [2018-01-28 21:44:45,388 INFO L226 Difference]: Without dead ends: 137 [2018-01-28 21:44:45,389 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:44:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-28 21:44:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 110. [2018-01-28 21:44:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-28 21:44:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-01-28 21:44:45,400 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 16 [2018-01-28 21:44:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:45,401 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-01-28 21:44:45,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:44:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-01-28 21:44:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 21:44:45,402 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:45,402 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:45,402 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1137446985, now seen corresponding path program 1 times [2018-01-28 21:44:45,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:45,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:45,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:45,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:45,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:45,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:45,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:44:45,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:44:45,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:44:45,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:44:45,470 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 3 states. [2018-01-28 21:44:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:45,494 INFO L93 Difference]: Finished difference Result 259 states and 270 transitions. [2018-01-28 21:44:45,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:44:45,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-28 21:44:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:45,495 INFO L225 Difference]: With dead ends: 259 [2018-01-28 21:44:45,495 INFO L226 Difference]: Without dead ends: 160 [2018-01-28 21:44:45,496 INFO L533 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-01-28 21:44:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-28 21:44:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-01-28 21:44:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-28 21:44:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2018-01-28 21:44:45,503 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 16 [2018-01-28 21:44:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:45,504 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2018-01-28 21:44:45,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:44:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2018-01-28 21:44:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 21:44:45,504 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:45,504 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:45,504 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:45,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1223206501, now seen corresponding path program 1 times [2018-01-28 21:44:45,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:45,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:45,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:45,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:45,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:45,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:45,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:44:45,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:44:45,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:44:45,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:44:45,547 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 4 states. [2018-01-28 21:44:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:45,681 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2018-01-28 21:44:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:44:45,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 21:44:45,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:45,682 INFO L225 Difference]: With dead ends: 166 [2018-01-28 21:44:45,682 INFO L226 Difference]: Without dead ends: 158 [2018-01-28 21:44:45,683 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-28 21:44:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-28 21:44:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 128. [2018-01-28 21:44:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-28 21:44:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2018-01-28 21:44:45,691 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 16 [2018-01-28 21:44:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:45,691 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2018-01-28 21:44:45,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:44:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2018-01-28 21:44:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 21:44:45,692 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:45,692 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:45,692 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1223206502, now seen corresponding path program 1 times [2018-01-28 21:44:45,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:45,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:45,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:45,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:45,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:45,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:45,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:44:45,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:44:45,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:44:45,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:44:45,782 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand 4 states. [2018-01-28 21:44:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:45,899 INFO L93 Difference]: Finished difference Result 187 states and 214 transitions. [2018-01-28 21:44:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:44:45,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 21:44:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:45,901 INFO L225 Difference]: With dead ends: 187 [2018-01-28 21:44:45,901 INFO L226 Difference]: Without dead ends: 181 [2018-01-28 21:44:45,902 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-28 21:44:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 130. [2018-01-28 21:44:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-28 21:44:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2018-01-28 21:44:45,915 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 16 [2018-01-28 21:44:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:45,915 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2018-01-28 21:44:45,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:44:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2018-01-28 21:44:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:44:45,916 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:45,917 INFO L330 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] [2018-01-28 21:44:45,917 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash -979462939, now seen corresponding path program 1 times [2018-01-28 21:44:45,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:45,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:45,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:45,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:45,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:46,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:46,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:44:46,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:44:46,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:44:46,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:46,055 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand 5 states. [2018-01-28 21:44:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:46,270 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2018-01-28 21:44:46,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:44:46,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-28 21:44:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:46,272 INFO L225 Difference]: With dead ends: 240 [2018-01-28 21:44:46,272 INFO L226 Difference]: Without dead ends: 237 [2018-01-28 21:44:46,272 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:44:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-28 21:44:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 120. [2018-01-28 21:44:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-28 21:44:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2018-01-28 21:44:46,283 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 29 [2018-01-28 21:44:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:46,283 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2018-01-28 21:44:46,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:44:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2018-01-28 21:44:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 21:44:46,284 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:46,285 INFO L330 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-01-28 21:44:46,285 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:46,285 INFO L82 PathProgramCache]: Analyzing trace with hash -298580033, now seen corresponding path program 1 times [2018-01-28 21:44:46,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:46,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:46,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:46,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:46,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:46,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:46,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:46,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:44:46,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:44:46,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:44:46,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:44:46,335 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 4 states. [2018-01-28 21:44:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:46,480 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2018-01-28 21:44:46,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:44:46,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-28 21:44:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:46,482 INFO L225 Difference]: With dead ends: 185 [2018-01-28 21:44:46,483 INFO L226 Difference]: Without dead ends: 181 [2018-01-28 21:44:46,483 INFO L533 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-01-28 21:44:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-28 21:44:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 116. [2018-01-28 21:44:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-28 21:44:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-01-28 21:44:46,491 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 30 [2018-01-28 21:44:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:46,491 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-01-28 21:44:46,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:44:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-01-28 21:44:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 21:44:46,492 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:46,492 INFO L330 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-01-28 21:44:46,493 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash -298580032, now seen corresponding path program 1 times [2018-01-28 21:44:46,493 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:46,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:46,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:46,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:46,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:46,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:46,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:46,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:44:46,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:44:46,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:44:46,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:44:46,591 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 4 states. [2018-01-28 21:44:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:46,695 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2018-01-28 21:44:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:44:46,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-28 21:44:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:46,697 INFO L225 Difference]: With dead ends: 173 [2018-01-28 21:44:46,697 INFO L226 Difference]: Without dead ends: 169 [2018-01-28 21:44:46,697 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-28 21:44:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2018-01-28 21:44:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 21:44:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-28 21:44:46,702 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 30 [2018-01-28 21:44:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:46,702 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-28 21:44:46,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:44:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-28 21:44:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 21:44:46,704 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:46,704 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:46,704 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -120455318, now seen corresponding path program 1 times [2018-01-28 21:44:46,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:46,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:46,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:46,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:46,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:46,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:46,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:46,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:44:46,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:44:46,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:44:46,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:44:46,827 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 6 states. [2018-01-28 21:44:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:47,086 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-01-28 21:44:47,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:44:47,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-28 21:44:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:47,088 INFO L225 Difference]: With dead ends: 196 [2018-01-28 21:44:47,088 INFO L226 Difference]: Without dead ends: 195 [2018-01-28 21:44:47,088 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:44:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-28 21:44:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 136. [2018-01-28 21:44:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-28 21:44:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-01-28 21:44:47,095 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 33 [2018-01-28 21:44:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:47,096 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-01-28 21:44:47,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:44:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-01-28 21:44:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 21:44:47,097 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:47,097 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:47,097 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash -120455317, now seen corresponding path program 1 times [2018-01-28 21:44:47,098 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:47,098 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:47,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:47,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:47,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:47,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:47,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:47,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:44:47,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:44:47,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:44:47,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:44:47,556 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 10 states. [2018-01-28 21:44:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:47,909 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-01-28 21:44:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:44:47,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-28 21:44:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:47,911 INFO L225 Difference]: With dead ends: 247 [2018-01-28 21:44:47,911 INFO L226 Difference]: Without dead ends: 246 [2018-01-28 21:44:47,912 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-28 21:44:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-01-28 21:44:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 136. [2018-01-28 21:44:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-28 21:44:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-01-28 21:44:47,921 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 33 [2018-01-28 21:44:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:47,922 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-01-28 21:44:47,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:44:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-01-28 21:44:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:44:47,923 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:47,924 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:47,924 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1856850331, now seen corresponding path program 1 times [2018-01-28 21:44:47,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:47,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:47,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:47,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:47,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:47,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:47,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:47,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:44:47,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:44:47,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:44:47,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:47,970 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-01-28 21:44:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:48,036 INFO L93 Difference]: Finished difference Result 229 states and 242 transitions. [2018-01-28 21:44:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:44:48,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-28 21:44:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:48,037 INFO L225 Difference]: With dead ends: 229 [2018-01-28 21:44:48,037 INFO L226 Difference]: Without dead ends: 145 [2018-01-28 21:44:48,038 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:44:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-28 21:44:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2018-01-28 21:44:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-28 21:44:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2018-01-28 21:44:48,045 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 36 [2018-01-28 21:44:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:48,045 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2018-01-28 21:44:48,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:44:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-01-28 21:44:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:44:48,046 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:48,047 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:48,047 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1856849657, now seen corresponding path program 1 times [2018-01-28 21:44:48,047 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:48,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:48,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:48,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:48,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:48,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:48,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:44:48,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:44:48,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:44:48,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:44:48,096 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 4 states. [2018-01-28 21:44:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:48,285 INFO L93 Difference]: Finished difference Result 165 states and 172 transitions. [2018-01-28 21:44:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:44:48,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-28 21:44:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:48,286 INFO L225 Difference]: With dead ends: 165 [2018-01-28 21:44:48,286 INFO L226 Difference]: Without dead ends: 164 [2018-01-28 21:44:48,287 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-28 21:44:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 140. [2018-01-28 21:44:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-28 21:44:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-01-28 21:44:48,293 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 36 [2018-01-28 21:44:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:48,293 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-01-28 21:44:48,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:44:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-01-28 21:44:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 21:44:48,294 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:48,294 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:48,294 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1856849656, now seen corresponding path program 1 times [2018-01-28 21:44:48,295 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:48,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:48,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:48,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:48,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:48,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:48,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:44:48,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:44:48,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:44:48,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:48,387 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2018-01-28 21:44:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:48,519 INFO L93 Difference]: Finished difference Result 224 states and 238 transitions. [2018-01-28 21:44:48,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:44:48,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-28 21:44:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:48,520 INFO L225 Difference]: With dead ends: 224 [2018-01-28 21:44:48,520 INFO L226 Difference]: Without dead ends: 223 [2018-01-28 21:44:48,521 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:44:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-28 21:44:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 170. [2018-01-28 21:44:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-28 21:44:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-01-28 21:44:48,533 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 36 [2018-01-28 21:44:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:48,533 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-01-28 21:44:48,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:44:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-01-28 21:44:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:44:48,534 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:48,534 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:48,534 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1770730196, now seen corresponding path program 1 times [2018-01-28 21:44:48,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:48,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:48,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:48,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:48,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:48,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:48,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:44:48,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:44:48,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:44:48,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:44:48,595 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 5 states. [2018-01-28 21:44:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:48,761 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions. [2018-01-28 21:44:48,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:44:48,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-28 21:44:48,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:48,762 INFO L225 Difference]: With dead ends: 207 [2018-01-28 21:44:48,762 INFO L226 Difference]: Without dead ends: 205 [2018-01-28 21:44:48,763 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:44:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-28 21:44:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 176. [2018-01-28 21:44:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-28 21:44:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2018-01-28 21:44:48,771 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 39 [2018-01-28 21:44:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:48,771 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2018-01-28 21:44:48,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:44:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2018-01-28 21:44:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:44:48,772 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:48,772 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:48,773 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1770730197, now seen corresponding path program 1 times [2018-01-28 21:44:48,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:48,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:48,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:48,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:48,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:48,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:48,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:44:48,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:44:48,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:44:48,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:44:48,915 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 6 states. [2018-01-28 21:44:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:49,185 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-28 21:44:49,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:44:49,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-28 21:44:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:49,211 INFO L225 Difference]: With dead ends: 263 [2018-01-28 21:44:49,212 INFO L226 Difference]: Without dead ends: 261 [2018-01-28 21:44:49,212 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:44:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-28 21:44:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 192. [2018-01-28 21:44:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-28 21:44:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2018-01-28 21:44:49,226 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 39 [2018-01-28 21:44:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:49,227 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2018-01-28 21:44:49,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:44:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2018-01-28 21:44:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 21:44:49,227 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:49,227 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:49,228 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1125844892, now seen corresponding path program 1 times [2018-01-28 21:44:49,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:49,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:49,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:49,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:49,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:49,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:49,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:49,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:44:49,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:44:49,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:44:49,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:44:49,352 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand 9 states. [2018-01-28 21:44:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:49,861 INFO L93 Difference]: Finished difference Result 282 states and 312 transitions. [2018-01-28 21:44:49,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 21:44:49,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-01-28 21:44:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:49,865 INFO L225 Difference]: With dead ends: 282 [2018-01-28 21:44:49,865 INFO L226 Difference]: Without dead ends: 281 [2018-01-28 21:44:49,865 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-01-28 21:44:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-01-28 21:44:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 209. [2018-01-28 21:44:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-28 21:44:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2018-01-28 21:44:49,878 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 45 [2018-01-28 21:44:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:49,878 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2018-01-28 21:44:49,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:44:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2018-01-28 21:44:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 21:44:49,879 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:49,879 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:49,879 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1125844893, now seen corresponding path program 1 times [2018-01-28 21:44:49,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:49,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:49,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:49,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:49,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:49,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:49,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:44:49,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:44:49,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:44:49,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:44:49,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:44:49,998 INFO L87 Difference]: Start difference. First operand 209 states and 235 transitions. Second operand 8 states. [2018-01-28 21:44:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:50,327 INFO L93 Difference]: Finished difference Result 316 states and 357 transitions. [2018-01-28 21:44:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:44:50,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-28 21:44:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:50,329 INFO L225 Difference]: With dead ends: 316 [2018-01-28 21:44:50,329 INFO L226 Difference]: Without dead ends: 273 [2018-01-28 21:44:50,330 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:44:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-28 21:44:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 207. [2018-01-28 21:44:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-01-28 21:44:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 231 transitions. [2018-01-28 21:44:50,344 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 231 transitions. Word has length 45 [2018-01-28 21:44:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:50,344 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 231 transitions. [2018-01-28 21:44:50,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:44:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 231 transitions. [2018-01-28 21:44:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:44:50,345 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:50,346 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:50,346 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1643371772, now seen corresponding path program 1 times [2018-01-28 21:44:50,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:50,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:50,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:50,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:50,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:50,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:50,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:50,442 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:50,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:50,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:44:50,589 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-01-28 21:44:50,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:50,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:50,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 21:44:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:50,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:44:50,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-01-28 21:44:50,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:44:50,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:44:50,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:44:50,713 INFO L87 Difference]: Start difference. First operand 207 states and 231 transitions. Second operand 9 states. [2018-01-28 21:44:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:50,976 INFO L93 Difference]: Finished difference Result 231 states and 256 transitions. [2018-01-28 21:44:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:44:50,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-28 21:44:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:50,978 INFO L225 Difference]: With dead ends: 231 [2018-01-28 21:44:50,978 INFO L226 Difference]: Without dead ends: 230 [2018-01-28 21:44:50,978 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:44:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-28 21:44:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 206. [2018-01-28 21:44:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-28 21:44:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 229 transitions. [2018-01-28 21:44:50,990 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 229 transitions. Word has length 47 [2018-01-28 21:44:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:50,990 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 229 transitions. [2018-01-28 21:44:50,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:44:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 229 transitions. [2018-01-28 21:44:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:44:50,991 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:50,991 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:50,991 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1643371771, now seen corresponding path program 1 times [2018-01-28 21:44:50,991 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:50,991 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:50,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:50,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:50,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:51,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:51,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:51,208 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:51,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:51,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:44:51,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:51,384 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-01-28 21:44:51,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:51,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:51,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:51,405 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-01-28 21:44:51,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:51,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:51,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-28 21:44:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:51,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:44:51,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-01-28 21:44:51,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:44:51,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:44:51,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:44:51,517 INFO L87 Difference]: Start difference. First operand 206 states and 229 transitions. Second operand 11 states. [2018-01-28 21:44:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:52,273 INFO L93 Difference]: Finished difference Result 334 states and 367 transitions. [2018-01-28 21:44:52,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 21:44:52,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-28 21:44:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:52,275 INFO L225 Difference]: With dead ends: 334 [2018-01-28 21:44:52,275 INFO L226 Difference]: Without dead ends: 333 [2018-01-28 21:44:52,276 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:44:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-28 21:44:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2018-01-28 21:44:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-28 21:44:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 227 transitions. [2018-01-28 21:44:52,293 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 227 transitions. Word has length 47 [2018-01-28 21:44:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:52,294 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 227 transitions. [2018-01-28 21:44:52,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:44:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 227 transitions. [2018-01-28 21:44:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:44:52,311 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:52,311 INFO L330 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-01-28 21:44:52,312 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:52,312 INFO L82 PathProgramCache]: Analyzing trace with hash 598606883, now seen corresponding path program 1 times [2018-01-28 21:44:52,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:52,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:52,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:52,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:52,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:52,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:52,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:52,429 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:52,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:52,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:44:52,600 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-28 21:44:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 21:44:52,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:44:52,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-28 21:44:52,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 21:44:52,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 21:44:52,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-01-28 21:44:52,647 INFO L87 Difference]: Start difference. First operand 205 states and 227 transitions. Second operand 14 states. [2018-01-28 21:44:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:53,170 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2018-01-28 21:44:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:44:53,170 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-01-28 21:44:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:53,171 INFO L225 Difference]: With dead ends: 237 [2018-01-28 21:44:53,171 INFO L226 Difference]: Without dead ends: 234 [2018-01-28 21:44:53,172 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=289, Unknown=1, NotChecked=36, Total=420 [2018-01-28 21:44:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-28 21:44:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 208. [2018-01-28 21:44:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-28 21:44:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 230 transitions. [2018-01-28 21:44:53,184 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 230 transitions. Word has length 48 [2018-01-28 21:44:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:53,184 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 230 transitions. [2018-01-28 21:44:53,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 21:44:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 230 transitions. [2018-01-28 21:44:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:44:53,184 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:53,185 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:53,185 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash 598607557, now seen corresponding path program 1 times [2018-01-28 21:44:53,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:53,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:53,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:53,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:53,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:53,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:53,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:53,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:53,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:53,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:44:53,382 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-01-28 21:44:53,384 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-01-28 21:44:53,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,407 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-01-28 21:44:53,409 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-01-28 21:44:53,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-28 21:44:53,445 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 23 treesize of output 18 [2018-01-28 21:44:53,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,450 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-01-28 21:44:53,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,466 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 23 treesize of output 18 [2018-01-28 21:44:53,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,469 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-01-28 21:44:53,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-01-28 21:44:53,496 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 30 treesize of output 23 [2018-01-28 21:44:53,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,502 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-01-28 21:44:53,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,527 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 30 treesize of output 23 [2018-01-28 21:44:53,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,532 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:44:53,532 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 55 [2018-01-28 21:44:53,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-28 21:44:53,574 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 39 treesize of output 30 [2018-01-28 21:44:53,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,584 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 30 treesize of output 77 [2018-01-28 21:44:53,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,613 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 39 treesize of output 30 [2018-01-28 21:44:53,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,623 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:44:53,624 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 30 treesize of output 90 [2018-01-28 21:44:53,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-01-28 21:44:53,675 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 54 treesize of output 43 [2018-01-28 21:44:53,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-28 21:44:53,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,728 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 54 treesize of output 43 [2018-01-28 21:44:53,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,739 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:44:53,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-28 21:44:53,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:53,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:75 [2018-01-28 21:44:53,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-01-28 21:44:53,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:53,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 81 [2018-01-28 21:44:53,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:44:53,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:44:54,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-01-28 21:44:54,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:44:54,034 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:44:54,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 84 [2018-01-28 21:44:54,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 21:44:54,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:44:54,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 21:44:54,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:31 [2018-01-28 21:44:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:54,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:44:54,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 17 [2018-01-28 21:44:54,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:44:54,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:44:54,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:44:54,240 INFO L87 Difference]: Start difference. First operand 208 states and 230 transitions. Second operand 17 states. [2018-01-28 21:44:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:57,987 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2018-01-28 21:44:57,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:44:57,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-01-28 21:44:57,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:57,988 INFO L225 Difference]: With dead ends: 253 [2018-01-28 21:44:57,988 INFO L226 Difference]: Without dead ends: 205 [2018-01-28 21:44:57,989 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 21:44:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-28 21:44:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2018-01-28 21:44:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-28 21:44:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2018-01-28 21:44:58,000 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 48 [2018-01-28 21:44:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:58,001 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2018-01-28 21:44:58,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:44:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2018-01-28 21:44:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:44:58,001 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:58,001 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:58,001 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -983487307, now seen corresponding path program 1 times [2018-01-28 21:44:58,002 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:58,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:58,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:58,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:58,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:58,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:58,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:58,146 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:58,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:58,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:44:58,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:44:58,184 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-01-28 21:44:58,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-28 21:44:58,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-28 21:44:58,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-28 21:44:58,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-28 21:44:58,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-28 21:44:58,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,277 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-01-28 21:44:58,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-28 21:44:58,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-28 21:44:58,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-01-28 21:44:58,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:44:58,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-01-28 21:44:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:58,318 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:44:58,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-01-28 21:44:58,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 21:44:58,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 21:44:58,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-28 21:44:58,319 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand 13 states. [2018-01-28 21:44:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:58,625 INFO L93 Difference]: Finished difference Result 221 states and 241 transitions. [2018-01-28 21:44:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:44:58,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-01-28 21:44:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:58,628 INFO L225 Difference]: With dead ends: 221 [2018-01-28 21:44:58,629 INFO L226 Difference]: Without dead ends: 220 [2018-01-28 21:44:58,629 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:44:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-28 21:44:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 192. [2018-01-28 21:44:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-28 21:44:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-01-28 21:44:58,643 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 50 [2018-01-28 21:44:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:58,644 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-01-28 21:44:58,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 21:44:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-01-28 21:44:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:44:58,645 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:58,645 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:58,645 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash -983487306, now seen corresponding path program 1 times [2018-01-28 21:44:58,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:58,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:58,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:58,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:58,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:58,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:58,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:58,834 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:58,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:58,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:44:58,884 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-01-28 21:44:58,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:44:58,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:44:58,923 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-01-28 21:44:58,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:44:58,937 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-01-28 21:44:58,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-28 21:44:58,960 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 31 treesize of output 22 [2018-01-28 21:44:58,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:58,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-28 21:44:59,023 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 32 treesize of output 40 [2018-01-28 21:44:59,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-01-28 21:44:59,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,045 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 29 treesize of output 28 [2018-01-28 21:44:59,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-28 21:44:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-28 21:44:59,081 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,095 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 22 treesize of output 21 [2018-01-28 21:44:59,095 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 21:44:59,112 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-28 21:44:59,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-28 21:44:59,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-28 21:44:59,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-01-28 21:44:59,175 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 29 treesize of output 22 [2018-01-28 21:44:59,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-01-28 21:44:59,187 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,197 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 25 treesize of output 9 [2018-01-28 21:44:59,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:44:59,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:44:59,208 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-28 21:44:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:59,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:44:59,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2018-01-28 21:44:59,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:44:59,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:44:59,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-01-28 21:44:59,271 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 17 states. [2018-01-28 21:44:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:44:59,823 INFO L93 Difference]: Finished difference Result 299 states and 331 transitions. [2018-01-28 21:44:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:44:59,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-01-28 21:44:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:44:59,825 INFO L225 Difference]: With dead ends: 299 [2018-01-28 21:44:59,825 INFO L226 Difference]: Without dead ends: 298 [2018-01-28 21:44:59,826 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=475, Unknown=4, NotChecked=0, Total=650 [2018-01-28 21:44:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-28 21:44:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 170. [2018-01-28 21:44:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-28 21:44:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 188 transitions. [2018-01-28 21:44:59,839 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 188 transitions. Word has length 50 [2018-01-28 21:44:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:44:59,840 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 188 transitions. [2018-01-28 21:44:59,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:44:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2018-01-28 21:44:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:44:59,841 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:44:59,841 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:44:59,841 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:44:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1526367197, now seen corresponding path program 1 times [2018-01-28 21:44:59,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:44:59,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:44:59,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:59,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:59,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:44:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:59,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:44:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:44:59,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:44:59,957 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:44:59,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:44:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:44:59,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:45:00,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:00,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:00,028 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 14 treesize of output 23 [2018-01-28 21:45:00,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:00,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:00,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:00,039 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-01-28 21:45:00,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:00,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:00,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-01-28 21:45:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:00,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:45:00,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2018-01-28 21:45:00,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 21:45:00,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 21:45:00,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:45:00,127 INFO L87 Difference]: Start difference. First operand 170 states and 188 transitions. Second operand 14 states. [2018-01-28 21:45:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:00,525 INFO L93 Difference]: Finished difference Result 308 states and 339 transitions. [2018-01-28 21:45:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:45:00,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-01-28 21:45:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:00,527 INFO L225 Difference]: With dead ends: 308 [2018-01-28 21:45:00,527 INFO L226 Difference]: Without dead ends: 307 [2018-01-28 21:45:00,527 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:45:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-28 21:45:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 196. [2018-01-28 21:45:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-28 21:45:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-01-28 21:45:00,537 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 53 [2018-01-28 21:45:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:00,538 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-01-28 21:45:00,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 21:45:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-01-28 21:45:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 21:45:00,538 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:00,538 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:00,538 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1186462688, now seen corresponding path program 1 times [2018-01-28 21:45:00,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:00,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:00,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:00,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:00,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:00,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-28 21:45:00,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:45:00,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:45:00,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:45:00,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:45:00,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:45:00,624 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 7 states. [2018-01-28 21:45:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:00,751 INFO L93 Difference]: Finished difference Result 223 states and 244 transitions. [2018-01-28 21:45:00,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:45:00,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-01-28 21:45:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:00,752 INFO L225 Difference]: With dead ends: 223 [2018-01-28 21:45:00,752 INFO L226 Difference]: Without dead ends: 221 [2018-01-28 21:45:00,753 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:45:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-28 21:45:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-01-28 21:45:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-28 21:45:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-01-28 21:45:00,765 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 56 [2018-01-28 21:45:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:00,766 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-01-28 21:45:00,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:45:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-01-28 21:45:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 21:45:00,767 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:00,767 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:00,767 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:00,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1716413337, now seen corresponding path program 1 times [2018-01-28 21:45:00,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:00,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:00,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:00,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:00,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:00,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:00,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:45:00,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:45:00,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:45:00,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:45:00,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:45:00,869 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 8 states. [2018-01-28 21:45:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:01,156 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2018-01-28 21:45:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 21:45:01,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-01-28 21:45:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:01,158 INFO L225 Difference]: With dead ends: 207 [2018-01-28 21:45:01,158 INFO L226 Difference]: Without dead ends: 206 [2018-01-28 21:45:01,158 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:45:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-28 21:45:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 184. [2018-01-28 21:45:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 21:45:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2018-01-28 21:45:01,177 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 62 [2018-01-28 21:45:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:01,178 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2018-01-28 21:45:01,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:45:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2018-01-28 21:45:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 21:45:01,179 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:01,179 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:01,179 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1716413336, now seen corresponding path program 1 times [2018-01-28 21:45:01,179 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:01,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:01,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:01,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:01,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:01,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:01,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:45:01,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:45:01,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:45:01,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:45:01,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:45:01,320 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand 9 states. [2018-01-28 21:45:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:01,870 INFO L93 Difference]: Finished difference Result 335 states and 371 transitions. [2018-01-28 21:45:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 21:45:01,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-01-28 21:45:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:01,872 INFO L225 Difference]: With dead ends: 335 [2018-01-28 21:45:01,872 INFO L226 Difference]: Without dead ends: 334 [2018-01-28 21:45:01,872 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:45:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-28 21:45:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 184. [2018-01-28 21:45:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 21:45:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2018-01-28 21:45:01,883 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 62 [2018-01-28 21:45:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:01,884 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2018-01-28 21:45:01,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:45:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2018-01-28 21:45:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-28 21:45:01,884 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:01,884 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 21:45:01,884 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2131019912, now seen corresponding path program 1 times [2018-01-28 21:45:01,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:01,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:01,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:01,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:01,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:01,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:02,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:45:02,032 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:45:02,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:02,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:45:02,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:02,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:02,119 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-01-28 21:45:02,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:02,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:02,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-28 21:45:02,148 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-01-28 21:45:02,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:45:02,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:02,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:02,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:02,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-01-28 21:45:02,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-28 21:45:02,219 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-28 21:45:02,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:02,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:02,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:02,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-28 21:45:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:02,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:45:02,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-01-28 21:45:02,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 21:45:02,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 21:45:02,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-01-28 21:45:02,309 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand 22 states. [2018-01-28 21:45:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:03,354 INFO L93 Difference]: Finished difference Result 394 states and 431 transitions. [2018-01-28 21:45:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 21:45:03,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-01-28 21:45:03,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:03,356 INFO L225 Difference]: With dead ends: 394 [2018-01-28 21:45:03,356 INFO L226 Difference]: Without dead ends: 360 [2018-01-28 21:45:03,357 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1162, Unknown=0, NotChecked=0, Total=1482 [2018-01-28 21:45:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-28 21:45:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 184. [2018-01-28 21:45:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-28 21:45:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2018-01-28 21:45:03,376 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 65 [2018-01-28 21:45:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:03,376 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2018-01-28 21:45:03,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 21:45:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2018-01-28 21:45:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-28 21:45:03,377 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:03,377 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:03,377 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2083953431, now seen corresponding path program 1 times [2018-01-28 21:45:03,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:03,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:03,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:03,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:03,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:03,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:03,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:45:03,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:45:03,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:45:03,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:45:03,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:45:03,527 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand 10 states. [2018-01-28 21:45:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:03,859 INFO L93 Difference]: Finished difference Result 387 states and 424 transitions. [2018-01-28 21:45:03,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:45:03,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-01-28 21:45:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:03,860 INFO L225 Difference]: With dead ends: 387 [2018-01-28 21:45:03,860 INFO L226 Difference]: Without dead ends: 386 [2018-01-28 21:45:03,861 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2018-01-28 21:45:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-28 21:45:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 187. [2018-01-28 21:45:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-28 21:45:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 206 transitions. [2018-01-28 21:45:03,881 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 206 transitions. Word has length 65 [2018-01-28 21:45:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:03,882 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 206 transitions. [2018-01-28 21:45:03,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:45:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 206 transitions. [2018-01-28 21:45:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-28 21:45:03,883 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:03,883 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:03,883 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2083953430, now seen corresponding path program 1 times [2018-01-28 21:45:03,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:03,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:03,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:03,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:03,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:03,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 21:45:03,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:45:03,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:45:03,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:45:03,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:45:03,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:45:03,941 INFO L87 Difference]: Start difference. First operand 187 states and 206 transitions. Second operand 4 states. [2018-01-28 21:45:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:04,029 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2018-01-28 21:45:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:45:04,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-01-28 21:45:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:04,030 INFO L225 Difference]: With dead ends: 187 [2018-01-28 21:45:04,030 INFO L226 Difference]: Without dead ends: 186 [2018-01-28 21:45:04,031 INFO L533 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-01-28 21:45:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-28 21:45:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-01-28 21:45:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-28 21:45:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-28 21:45:04,050 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 65 [2018-01-28 21:45:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:04,051 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-28 21:45:04,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:45:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-28 21:45:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 21:45:04,051 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:04,052 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:04,052 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash 563239090, now seen corresponding path program 1 times [2018-01-28 21:45:04,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:04,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:04,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:04,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:04,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:04,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:04,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:45:04,492 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:45:04,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:04,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:45:04,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:45:04,580 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-01-28 21:45:04,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:45:04,595 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-01-28 21:45:04,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-28 21:45:04,653 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 21 treesize of output 16 [2018-01-28 21:45:04,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,656 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-01-28 21:45:04,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,678 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 21 treesize of output 16 [2018-01-28 21:45:04,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,681 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-01-28 21:45:04,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,695 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-01-28 21:45:04,725 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 36 treesize of output 29 [2018-01-28 21:45:04,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,733 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 29 treesize of output 37 [2018-01-28 21:45:04,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,757 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 36 treesize of output 29 [2018-01-28 21:45:04,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,764 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 29 treesize of output 37 [2018-01-28 21:45:04,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-01-28 21:45:04,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:04,880 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-01-28 21:45:04,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-01-28 21:45:04,952 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 30 treesize of output 31 [2018-01-28 21:45:04,954 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-01-28 21:45:04,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:04,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,016 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 30 treesize of output 31 [2018-01-28 21:45:05,018 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-01-28 21:45:05,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-28 21:45:05,104 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 39 treesize of output 38 [2018-01-28 21:45:05,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,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, 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-01-28 21:45:05,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,143 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 39 treesize of output 38 [2018-01-28 21:45:05,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,146 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-01-28 21:45:05,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:85 [2018-01-28 21:45:05,225 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 46 treesize of output 43 [2018-01-28 21:45:05,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-28 21:45:05,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,280 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 46 treesize of output 43 [2018-01-28 21:45:05,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,288 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-01-28 21:45:05,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-28 21:45:05,380 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 55 treesize of output 50 [2018-01-28 21:45:05,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,391 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-01-28 21:45:05,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,440 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 55 treesize of output 50 [2018-01-28 21:45:05,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,450 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 30 treesize of output 77 [2018-01-28 21:45:05,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:117 [2018-01-28 21:45:05,556 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 70 treesize of output 63 [2018-01-28 21:45:05,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-28 21:45:05,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,641 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 70 treesize of output 63 [2018-01-28 21:45:05,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-28 21:45:05,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:155, output treesize:117 [2018-01-28 21:45:05,716 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 64 treesize of output 61 [2018-01-28 21:45:05,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,723 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-01-28 21:45:05,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,774 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 64 treesize of output 61 [2018-01-28 21:45:05,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-28 21:45:05,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:135 [2018-01-28 21:45:05,882 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:05,885 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 267 treesize of output 249 [2018-01-28 21:45:05,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 212 [2018-01-28 21:45:05,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:05,977 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 246 treesize of output 208 [2018-01-28 21:45:05,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:05,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 231 [2018-01-28 21:45:05,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,038 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:299, output treesize:237 [2018-01-28 21:45:06,150 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 222 treesize of output 177 [2018-01-28 21:45:06,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 123 [2018-01-28 21:45:06,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,187 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2018-01-28 21:45:06,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:06,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:06,215 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 94 treesize of output 72 [2018-01-28 21:45:06,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 68 treesize of output 50 [2018-01-28 21:45:06,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:06,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:06,236 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:06,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-01-28 21:45:06,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:06,248 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:251, output treesize:13 [2018-01-28 21:45:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:06,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:45:06,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 33 [2018-01-28 21:45:06,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:45:06,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:45:06,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:45:06,340 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 33 states. [2018-01-28 21:45:07,273 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-01-28 21:45:07,860 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-01-28 21:45:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:08,180 INFO L93 Difference]: Finished difference Result 338 states and 368 transitions. [2018-01-28 21:45:08,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 21:45:08,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-01-28 21:45:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:08,181 INFO L225 Difference]: With dead ends: 338 [2018-01-28 21:45:08,182 INFO L226 Difference]: Without dead ends: 298 [2018-01-28 21:45:08,183 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 21:45:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-01-28 21:45:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 219. [2018-01-28 21:45:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-28 21:45:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2018-01-28 21:45:08,208 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 66 [2018-01-28 21:45:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:08,208 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2018-01-28 21:45:08,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:45:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2018-01-28 21:45:08,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 21:45:08,209 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:08,209 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-28 21:45:08,209 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash 695700203, now seen corresponding path program 1 times [2018-01-28 21:45:08,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:08,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:08,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:08,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:08,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:08,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:08,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:45:08,463 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:45:08,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:08,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:45:08,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 21:45:08,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:45:08,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-01-28 21:45:08,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-28 21:45:08,646 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 12 treesize of output 8 [2018-01-28 21:45:08,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2018-01-28 21:45:08,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:08,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-28 21:45:08,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:08,739 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-01-28 21:45:08,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-28 21:45:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:08,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:45:08,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-01-28 21:45:08,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-28 21:45:08,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-28 21:45:08,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2018-01-28 21:45:08,789 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand 30 states. [2018-01-28 21:45:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:10,279 INFO L93 Difference]: Finished difference Result 419 states and 458 transitions. [2018-01-28 21:45:10,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 21:45:10,279 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-01-28 21:45:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:10,280 INFO L225 Difference]: With dead ends: 419 [2018-01-28 21:45:10,280 INFO L226 Difference]: Without dead ends: 418 [2018-01-28 21:45:10,281 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=2312, Unknown=0, NotChecked=0, Total=2862 [2018-01-28 21:45:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-01-28 21:45:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 219. [2018-01-28 21:45:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-28 21:45:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2018-01-28 21:45:10,297 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 68 [2018-01-28 21:45:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:10,297 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2018-01-28 21:45:10,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-28 21:45:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2018-01-28 21:45:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:45:10,297 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:10,298 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:10,298 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1028451507, now seen corresponding path program 1 times [2018-01-28 21:45:10,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:10,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:10,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:10,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:10,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:10,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:10,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:45:10,603 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:45:10,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:10,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:45:10,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:10,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:10,709 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-01-28 21:45:10,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-28 21:45:10,818 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-01-28 21:45:10,819 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 21:45:10,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-28 21:45:10,857 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 38 treesize of output 34 [2018-01-28 21:45:10,867 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 14 treesize of output 13 [2018-01-28 21:45:10,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:10,898 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-01-28 21:45:10,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-28 21:45:11,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-28 21:45:11,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-28 21:45:11,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:11,123 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-01-28 21:45:11,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:11,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:11,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:11,218 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:16 [2018-01-28 21:45:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:11,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:45:11,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 27 [2018-01-28 21:45:11,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 21:45:11,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 21:45:11,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2018-01-28 21:45:11,601 INFO L87 Difference]: Start difference. First operand 219 states and 238 transitions. Second operand 27 states. [2018-01-28 21:45:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:45:12,985 INFO L93 Difference]: Finished difference Result 336 states and 361 transitions. [2018-01-28 21:45:12,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:45:12,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-01-28 21:45:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:45:12,986 INFO L225 Difference]: With dead ends: 336 [2018-01-28 21:45:12,986 INFO L226 Difference]: Without dead ends: 333 [2018-01-28 21:45:12,987 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=1825, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 21:45:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-28 21:45:13,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 293. [2018-01-28 21:45:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-28 21:45:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 323 transitions. [2018-01-28 21:45:13,021 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 323 transitions. Word has length 69 [2018-01-28 21:45:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:45:13,021 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 323 transitions. [2018-01-28 21:45:13,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 21:45:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 323 transitions. [2018-01-28 21:45:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:45:13,022 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:45:13,022 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:45:13,022 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 21:45:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1028450833, now seen corresponding path program 1 times [2018-01-28 21:45:13,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:45:13,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:45:13,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:13,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:13,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:45:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:13,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:45:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:13,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:45:13,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:45:13,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:45:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:45:13,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:45:13,408 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 39 treesize of output 36 [2018-01-28 21:45:13,410 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-01-28 21:45:13,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,419 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 39 treesize of output 36 [2018-01-28 21:45:13,420 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-01-28 21:45:13,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,449 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 35 treesize of output 32 [2018-01-28 21:45:13,450 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-01-28 21:45:13,450 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,459 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 35 treesize of output 32 [2018-01-28 21:45:13,460 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-01-28 21:45:13,460 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,467 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:13,484 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:79, output treesize:63 [2018-01-28 21:45:13,548 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 57 treesize of output 52 [2018-01-28 21:45:13,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,572 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-01-28 21:45:13,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,616 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 53 treesize of output 48 [2018-01-28 21:45:13,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,619 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-01-28 21:45:13,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,655 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 57 treesize of output 52 [2018-01-28 21:45:13,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,657 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-01-28 21:45:13,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-01-28 21:45:13,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,694 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-01-28 21:45:13,694 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,702 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:13,723 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:115, output treesize:99 [2018-01-28 21:45:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-01-28 21:45:13,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-28 21:45:13,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,845 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 30 treesize of output 23 [2018-01-28 21:45:13,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,849 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:13,850 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 55 [2018-01-28 21:45:13,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:149, output treesize:66 [2018-01-28 21:45:13,904 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 39 treesize of output 30 [2018-01-28 21:45:13,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,909 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-01-28 21:45:13,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,940 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 39 treesize of output 30 [2018-01-28 21:45:13,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,943 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,944 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:13,946 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:13,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-28 21:45:13,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:13,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:84 [2018-01-28 21:45:14,012 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 54 treesize of output 43 [2018-01-28 21:45:14,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 121 [2018-01-28 21:45:14,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,067 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 54 treesize of output 43 [2018-01-28 21:45:14,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,076 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:14,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-28 21:45:14,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:122, output treesize:84 [2018-01-28 21:45:14,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-28 21:45:14,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,209 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-01-28 21:45:14,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:98, output treesize:92 [2018-01-28 21:45:14,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-01-28 21:45:14,301 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-01-28 21:45:14,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,338 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-01-28 21:45:14,340 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-01-28 21:45:14,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,372 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-01-28 21:45:14,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:115 [2018-01-28 21:45:14,436 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-28 21:45:14,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,439 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-01-28 21:45:14,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-28 21:45:14,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,488 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-01-28 21:45:14,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,526 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-01-28 21:45:14,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:141, output treesize:133 [2018-01-28 21:45:14,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 70 [2018-01-28 21:45:14,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-01-28 21:45:14,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-28 21:45:14,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,703 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:14,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, 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 55 [2018-01-28 21:45:14,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,753 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-01-28 21:45:14,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:158, output treesize:150 [2018-01-28 21:45:14,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-01-28 21:45:14,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,829 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:14,829 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 30 treesize of output 90 [2018-01-28 21:45:14,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 85 [2018-01-28 21:45:14,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:14,921 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 118 [2018-01-28 21:45:14,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:14,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:14,991 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-01-28 21:45:14,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:176, output treesize:168 [2018-01-28 21:45:15,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 81 [2018-01-28 21:45:15,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,079 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:15,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-28 21:45:15,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:15,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:15,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 104 [2018-01-28 21:45:15,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,199 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 148 [2018-01-28 21:45:15,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:15,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:15,280 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-01-28 21:45:15,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:206, output treesize:168 [2018-01-28 21:45:15,314 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-01-28 21:45:15,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,329 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:15,330 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:15,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 92 [2018-01-28 21:45:15,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:15,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:15,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 92 [2018-01-28 21:45:15,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:15,479 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 12 case distinctions, treesize of input 54 treesize of output 179 [2018-01-28 21:45:15,479 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-28 21:45:15,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 56 xjuncts. [2018-01-28 21:45:16,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-01-28 21:45:16,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-28 21:45:16,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:194, output treesize:1737 [2018-01-28 21:45:18,230 WARN L146 SmtUtils]: Spent 1656ms on a formula simplification. DAG size of input: 253 DAG size of output 143 [2018-01-28 21:45:18,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,270 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:18,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 349 [2018-01-28 21:45:18,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:18,282 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:18,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 266 [2018-01-28 21:45:18,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:18,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:19,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 371 [2018-01-28 21:45:19,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:19,952 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:19,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 281 [2018-01-28 21:45:19,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:20,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:21,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 367 [2018-01-28 21:45:21,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:21,283 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:21,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 279 [2018-01-28 21:45:21,284 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:21,343 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:22,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 348 treesize of output 357 [2018-01-28 21:45:22,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:22,502 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 289 [2018-01-28 21:45:22,503 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:22,558 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:23,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 375 [2018-01-28 21:45:23,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:23,373 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:23,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 281 [2018-01-28 21:45:23,374 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:23,436 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:24,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 410 [2018-01-28 21:45:24,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,148 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 289 [2018-01-28 21:45:24,149 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:24,245 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:24,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 400 [2018-01-28 21:45:24,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:24,843 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:24,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 269 [2018-01-28 21:45:24,844 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:24,917 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:25,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 336 [2018-01-28 21:45:25,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:25,390 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 329 [2018-01-28 21:45:25,392 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 21:45:25,512 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-28 21:45:26,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 359 treesize of output 368 [2018-01-28 21:45:26,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,080 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 313 [2018-01-28 21:45:26,081 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:26,142 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:26,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 349 [2018-01-28 21:45:26,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:26,779 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 311 [2018-01-28 21:45:26,780 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:26,843 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:27,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 10 dim-2 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-01-28 21:45:27,240 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 16 variables, input treesize:1912, output treesize:2426 [2018-01-28 21:45:28,038 WARN L146 SmtUtils]: Spent 555ms on a formula simplification. DAG size of input: 416 DAG size of output 309 [2018-01-28 21:45:28,764 WARN L143 SmtUtils]: Spent 399ms on a formula simplification that was a NOOP. DAG size: 314 [2018-01-28 21:45:28,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 319 [2018-01-28 21:45:28,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,795 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 165 [2018-01-28 21:45:28,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:28,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:28,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 195 [2018-01-28 21:45:28,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:29,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:29,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 378 treesize of output 296 [2018-01-28 21:45:29,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 132 [2018-01-28 21:45:29,381 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:29,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 160 [2018-01-28 21:45:29,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:29,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:29,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 338 [2018-01-28 21:45:29,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:29,932 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 299 [2018-01-28 21:45:29,938 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-01-28 21:45:30,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 223 [2018-01-28 21:45:30,071 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:30,074 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,075 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,076 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:30,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 253 [2018-01-28 21:45:30,111 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-01-28 21:45:30,525 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-28 21:45:31,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 308 [2018-01-28 21:45:31,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:31,504 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 174 treesize of output 369 [2018-01-28 21:45:31,504 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-01-28 21:45:31,659 INFO L267 ElimStorePlain]: Start of recursive call 13: 164 dim-0 vars, End of recursive call: 164 dim-0 vars, and 180 xjuncts. [2018-01-28 21:45:33,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 238 [2018-01-28 21:45:33,164 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:33,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 227 [2018-01-28 21:45:33,172 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:33,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 207 treesize of output 288 [2018-01-28 21:45:33,196 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:33,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:33,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 233 [2018-01-28 21:45:33,206 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:33,459 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-01-28 21:45:34,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 304 [2018-01-28 21:45:34,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,801 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:34,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,806 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 177 [2018-01-28 21:45:34,807 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:34,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:34,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 157 [2018-01-28 21:45:34,893 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:34,961 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:36,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 122 [2018-01-28 21:45:36,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,401 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 85 [2018-01-28 21:45:36,405 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-01-28 21:45:36,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,477 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 152 [2018-01-28 21:45:36,502 INFO L267 ElimStorePlain]: Start of recursive call 23: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-01-28 21:45:36,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 114 [2018-01-28 21:45:36,523 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:36,769 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-28 21:45:36,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 135 [2018-01-28 21:45:36,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,781 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:36,823 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 205 [2018-01-28 21:45:36,823 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-28 21:45:36,853 INFO L267 ElimStorePlain]: Start of recursive call 26: 39 dim-0 vars, End of recursive call: 39 dim-0 vars, and 43 xjuncts. [2018-01-28 21:45:37,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2018-01-28 21:45:37,147 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:37,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2018-01-28 21:45:37,159 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:37,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:37,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2018-01-28 21:45:37,172 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:37,260 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-01-28 21:45:39,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 175 [2018-01-28 21:45:39,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,130 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 154 [2018-01-28 21:45:39,131 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:39,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77 [2018-01-28 21:45:39,181 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,211 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 165 [2018-01-28 21:45:39,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,219 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,230 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 165 [2018-01-28 21:45:39,230 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:39,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73 [2018-01-28 21:45:39,285 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,308 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 185 treesize of output 155 [2018-01-28 21:45:39,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,339 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 133 [2018-01-28 21:45:39,342 INFO L267 ElimStorePlain]: Start of recursive call 37: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-28 21:45:39,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-01-28 21:45:39,430 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2018-01-28 21:45:39,433 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,455 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:39,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 193 treesize of output 163 [2018-01-28 21:45:39,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,484 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 129 [2018-01-28 21:45:39,486 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:39,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-01-28 21:45:39,549 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,564 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 213 treesize of output 177 [2018-01-28 21:45:39,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,571 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,583 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 154 [2018-01-28 21:45:39,584 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 81 [2018-01-28 21:45:39,639 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,664 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 171 [2018-01-28 21:45:39,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,679 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,687 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 154 [2018-01-28 21:45:39,688 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:39,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 77 [2018-01-28 21:45:39,742 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,766 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:39,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 188 treesize of output 158 [2018-01-28 21:45:39,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,786 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 165 [2018-01-28 21:45:39,786 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:39,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:39,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 73 [2018-01-28 21:45:39,848 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:39,895 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:41,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 132 [2018-01-28 21:45:41,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,564 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 166 [2018-01-28 21:45:41,565 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-28 21:45:41,583 INFO L267 ElimStorePlain]: Start of recursive call 53: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 36 xjuncts. [2018-01-28 21:45:41,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2018-01-28 21:45:41,805 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:41,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:41,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 137 [2018-01-28 21:45:41,833 INFO L267 ElimStorePlain]: Start of recursive call 55: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-01-28 21:45:42,014 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-01-28 21:45:42,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 119 [2018-01-28 21:45:42,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:42,088 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 76 treesize of output 238 [2018-01-28 21:45:42,088 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-01-28 21:45:42,587 INFO L267 ElimStorePlain]: Start of recursive call 57: 388 dim-0 vars, End of recursive call: 388 dim-0 vars, and 412 xjuncts. [2018-01-28 21:45:47,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 97 [2018-01-28 21:45:47,363 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:47,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 107 [2018-01-28 21:45:47,379 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:47,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 114 [2018-01-28 21:45:47,391 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:47,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 113 [2018-01-28 21:45:47,407 INFO L267 ElimStorePlain]: Start of recursive call 61: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:47,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,411 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 112 [2018-01-28 21:45:47,424 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:47,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:47,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 109 [2018-01-28 21:45:47,435 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:47,761 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: 12 dim-0 vars, and 14 xjuncts. [2018-01-28 21:45:50,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 197 [2018-01-28 21:45:50,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,267 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,276 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:50,290 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 150 [2018-01-28 21:45:50,292 INFO L267 ElimStorePlain]: Start of recursive call 65: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:50,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-01-28 21:45:50,365 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,383 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 191 [2018-01-28 21:45:50,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,401 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:50,414 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 150 [2018-01-28 21:45:50,416 INFO L267 ElimStorePlain]: Start of recursive call 68: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:50,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-01-28 21:45:50,483 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,500 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 189 [2018-01-28 21:45:50,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,521 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:50,534 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 154 [2018-01-28 21:45:50,536 INFO L267 ElimStorePlain]: Start of recursive call 71: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:50,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2018-01-28 21:45:50,603 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,618 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 188 [2018-01-28 21:45:50,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,637 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 165 [2018-01-28 21:45:50,638 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:50,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 81 [2018-01-28 21:45:50,697 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,724 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 184 [2018-01-28 21:45:50,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,741 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:50,761 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 158 [2018-01-28 21:45:50,764 INFO L267 ElimStorePlain]: Start of recursive call 77: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-28 21:45:50,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2018-01-28 21:45:50,867 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2018-01-28 21:45:50,870 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:50,898 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:50,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 195 [2018-01-28 21:45:50,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:50,915 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:50,929 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 150 [2018-01-28 21:45:50,930 INFO L267 ElimStorePlain]: Start of recursive call 81: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:51,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2018-01-28 21:45:51,002 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:51,020 INFO L267 ElimStorePlain]: Start of recursive call 80: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:45:51,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 178 [2018-01-28 21:45:51,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,040 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:51,061 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 158 [2018-01-28 21:45:51,065 INFO L267 ElimStorePlain]: Start of recursive call 84: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-28 21:45:51,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2018-01-28 21:45:51,161 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:51,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2018-01-28 21:45:51,164 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:51,190 INFO L267 ElimStorePlain]: Start of recursive call 83: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:51,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 182 [2018-01-28 21:45:51,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,207 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 21:45:51,226 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 158 [2018-01-28 21:45:51,229 INFO L267 ElimStorePlain]: Start of recursive call 88: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-28 21:45:51,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2018-01-28 21:45:51,326 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:51,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2018-01-28 21:45:51,328 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:51,355 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:51,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 176 [2018-01-28 21:45:51,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,375 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 165 [2018-01-28 21:45:51,376 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:51,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:51,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 93 [2018-01-28 21:45:51,440 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 2 xjuncts. [2018-01-28 21:45:51,485 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:45:53,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 158 [2018-01-28 21:45:53,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:53,675 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 263 [2018-01-28 21:45:53,676 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-01-28 21:45:53,776 INFO L267 ElimStorePlain]: Start of recursive call 95: 103 dim-0 vars, End of recursive call: 103 dim-0 vars, and 109 xjuncts. [2018-01-28 21:45:54,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2018-01-28 21:45:54,565 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:54,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-01-28 21:45:54,572 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 21:45:54,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 71 [2018-01-28 21:45:54,589 INFO L267 ElimStorePlain]: Start of recursive call 98: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:54,699 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-28 21:45:54,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 137 [2018-01-28 21:45:54,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,736 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 101 [2018-01-28 21:45:54,736 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-28 21:45:54,740 INFO L267 ElimStorePlain]: Start of recursive call 100: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-01-28 21:45:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:54,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 136 [2018-01-28 21:45:54,818 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:54,950 INFO L267 ElimStorePlain]: Start of recursive call 99: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-28 21:45:57,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 10 dim-2 vars, End of recursive call: 60 dim-0 vars, and 67 xjuncts. [2018-01-28 21:45:57,511 INFO L202 ElimStorePlain]: Needed 101 recursive calls to eliminate 26 variables, input treesize:1872, output treesize:2108 [2018-01-28 21:45:57,940 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 541 DAG size of output 35 [2018-01-28 21:45:58,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:58,016 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 23 treesize of output 28 [2018-01-28 21:45:58,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:58,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:45:58,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-01-28 21:45:58,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:45:58,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-28 21:45:58,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2018-01-28 21:45:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:45:58,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:45:58,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 36 [2018-01-28 21:45:58,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 21:45:58,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 21:45:58,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1211, Unknown=1, NotChecked=0, Total=1332 [2018-01-28 21:45:58,263 INFO L87 Difference]: Start difference. First operand 293 states and 323 transitions. Second operand 37 states. [2018-01-28 21:46:20,653 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 108 DAG size of output 76 [2018-01-28 21:46:20,891 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 112 DAG size of output 80 [2018-01-28 21:46:24,452 WARN L146 SmtUtils]: Spent 409ms on a formula simplification. DAG size of input: 172 DAG size of output 132 [2018-01-28 21:46:25,391 WARN L146 SmtUtils]: Spent 794ms on a formula simplification. DAG size of input: 358 DAG size of output 351 [2018-01-28 21:46:26,197 WARN L146 SmtUtils]: Spent 663ms on a formula simplification. DAG size of input: 345 DAG size of output 334 [2018-01-28 21:46:34,710 WARN L146 SmtUtils]: Spent 588ms on a formula simplification. DAG size of input: 333 DAG size of output 324 [2018-01-28 21:46:38,699 WARN L146 SmtUtils]: Spent 1160ms on a formula simplification. DAG size of input: 355 DAG size of output 342 [2018-01-28 21:46:42,917 WARN L146 SmtUtils]: Spent 1252ms on a formula simplification. DAG size of input: 387 DAG size of output 351 [2018-01-28 21:46:45,354 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 82 DAG size of output 55 Received shutdown request... [2018-01-28 21:47:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-28 21:47:00,861 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-28 21:47:00,866 WARN L185 ceAbstractionStarter]: Timeout [2018-01-28 21:47:00,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:47:00 BoogieIcfgContainer [2018-01-28 21:47:00,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:47:00,867 INFO L168 Benchmark]: Toolchain (without parser) took 136729.05 ms. Allocated memory was 306.2 MB in the beginning and 748.2 MB in the end (delta: 442.0 MB). Free memory was 265.1 MB in the beginning and 618.1 MB in the end (delta: -353.1 MB). Peak memory consumption was 88.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:47:00,867 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.2 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:47:00,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.62 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 253.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:47:00,868 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:47:00,868 INFO L168 Benchmark]: RCFGBuilder took 442.62 ms. Allocated memory is still 306.2 MB. Free memory was 251.0 MB in the beginning and 222.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:47:00,868 INFO L168 Benchmark]: TraceAbstraction took 136039.41 ms. Allocated memory was 306.2 MB in the beginning and 748.2 MB in the end (delta: 442.0 MB). Free memory was 222.1 MB in the beginning and 618.1 MB in the end (delta: -396.0 MB). Peak memory consumption was 45.9 MB. Max. memory is 5.3 GB. [2018-01-28 21:47:00,870 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.17 ms. Allocated memory is still 306.2 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.62 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 253.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.16 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 442.62 ms. Allocated memory is still 306.2 MB. Free memory was 251.0 MB in the beginning and 222.1 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 136039.41 ms. Allocated memory was 306.2 MB in the beginning and 748.2 MB in the end (delta: 442.0 MB). Free memory was 222.1 MB in the beginning and 618.1 MB in the end (delta: -396.0 MB). Peak memory consumption was 45.9 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 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (293states) and interpolant automaton (currently 45 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 80 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 39 error locations. TIMEOUT Result, 135.9s OverallTime, 34 OverallIterations, 3 TraceHistogramMax, 79.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2734 SDtfs, 10217 SDslu, 13424 SDs, 0 SdLazy, 11090 SolverSat, 958 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 62.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1266 GetRequests, 639 SyntacticMatches, 48 SemanticMatches, 578 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3900 ImplicationChecksByTransitivity, 23.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=33, 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.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 2236 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 2177 NumberOfCodeBlocks, 2177 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2131 ConstructedInterpolants, 129 QuantifiedInterpolants, 2654039 SizeOfPredicates, 127 NumberOfNonLiveVariables, 2550 ConjunctsInSsa, 311 ConjunctsInUnsatCore, 46 InterpolantComputations, 22 PerfectInterpolantSequences, 199/395 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-47-00-878.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-47-00-878.csv Completed graceful shutdown