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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:11:31,946 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:11:31,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:11:31,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:11:31,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:11:31,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:11:31,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:11:31,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:11:31,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:11:31,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:11:31,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:11:31,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:11:31,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:11:31,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:11:31,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:11:31,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:11:31,976 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:11:31,978 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:11:31,979 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:11:31,981 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:11:31,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:11:31,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:11:31,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:11:31,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:11:31,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:11:31,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:11:31,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:11:31,988 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:11:31,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:11:31,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:11:31,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:11:31,989 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 22:11:31,999 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:11:32,000 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:11:32,001 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:11:32,001 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:11:32,001 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:11:32,001 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:11:32,001 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:11:32,002 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:11:32,002 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:11:32,003 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:11:32,003 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:11:32,003 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:11:32,003 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:11:32,003 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:11:32,004 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:11:32,004 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:11:32,004 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:11:32,004 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:11:32,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:11:32,005 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:11:32,005 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:11:32,005 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:11:32,005 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:11:32,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:11:32,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:11:32,006 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:11:32,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:11:32,006 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:11:32,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:11:32,007 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:11:32,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:11:32,007 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:11:32,008 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:11:32,008 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:11:32,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:11:32,058 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:11:32,062 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:11:32,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:11:32,065 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:11:32,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-28 22:11:32,271 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:11:32,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:11:32,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:11:32,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:11:32,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:11:32,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb0d8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32, skipping insertion in model container [2018-01-28 22:11:32,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,302 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:11:32,342 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:11:32,472 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:11:32,495 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:11:32,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32 WrapperNode [2018-01-28 22:11:32,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:11:32,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:11:32,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:11:32,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:11:32,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (1/1) ... [2018-01-28 22:11:32,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:11:32,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:11:32,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:11:32,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:11:32,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (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 22:11:32,599 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:11:32,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:11:32,600 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:11:32,600 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:11:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:11:33,090 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:11:33,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:11:33 BoogieIcfgContainer [2018-01-28 22:11:33,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:11:33,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:11:33,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:11:33,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:11:33,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:11:32" (1/3) ... [2018-01-28 22:11:33,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cf1c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:11:33, skipping insertion in model container [2018-01-28 22:11:33,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:11:32" (2/3) ... [2018-01-28 22:11:33,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cf1c1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:11:33, skipping insertion in model container [2018-01-28 22:11:33,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:11:33" (3/3) ... [2018-01-28 22:11:33,098 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-28 22:11:33,105 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:11:33,113 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-28 22:11:33,156 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:11:33,156 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:11:33,156 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:11:33,156 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:11:33,156 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:11:33,156 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:11:33,156 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:11:33,157 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:11:33,157 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:11:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-01-28 22:11:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 22:11:33,183 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:33,184 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:33,185 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 618424159, now seen corresponding path program 1 times [2018-01-28 22:11:33,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:33,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:33,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:33,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:33,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:33,312 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 22:11:33,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:33,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:11:33,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-28 22:11:33,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-28 22:11:33,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-28 22:11:33,330 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 2 states. [2018-01-28 22:11:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:33,443 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2018-01-28 22:11:33,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-28 22:11:33,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-28 22:11:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:33,456 INFO L225 Difference]: With dead ends: 264 [2018-01-28 22:11:33,456 INFO L226 Difference]: Without dead ends: 132 [2018-01-28 22:11:33,460 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 22:11:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-28 22:11:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-28 22:11:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-28 22:11:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-01-28 22:11:33,502 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 14 [2018-01-28 22:11:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:33,503 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-01-28 22:11:33,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-28 22:11:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-01-28 22:11:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 22:11:33,504 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:33,504 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] [2018-01-28 22:11:33,504 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash -301198612, now seen corresponding path program 1 times [2018-01-28 22:11:33,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:33,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:33,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:33,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:33,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:33,588 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 22:11:33,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:33,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:11:33,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:11:33,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:11:33,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:11:33,591 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 3 states. [2018-01-28 22:11:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:33,722 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-01-28 22:11:33,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:11:33,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-28 22:11:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:33,727 INFO L225 Difference]: With dead ends: 185 [2018-01-28 22:11:33,727 INFO L226 Difference]: Without dead ends: 182 [2018-01-28 22:11:33,728 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 22:11:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-28 22:11:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2018-01-28 22:11:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-28 22:11:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-28 22:11:33,742 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 20 [2018-01-28 22:11:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:33,743 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-28 22:11:33,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:11:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-28 22:11:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:11:33,744 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:33,744 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] [2018-01-28 22:11:33,745 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:33,745 INFO L82 PathProgramCache]: Analyzing trace with hash -814319768, now seen corresponding path program 1 times [2018-01-28 22:11:33,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:33,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:33,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:33,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:33,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:33,805 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 22:11:33,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:33,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:33,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:11:33,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:11:33,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:11:33,807 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 3 states. [2018-01-28 22:11:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:33,840 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-01-28 22:11:33,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:11:33,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-28 22:11:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:33,843 INFO L225 Difference]: With dead ends: 185 [2018-01-28 22:11:33,843 INFO L226 Difference]: Without dead ends: 142 [2018-01-28 22:11:33,844 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 22:11:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-28 22:11:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-01-28 22:11:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-28 22:11:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2018-01-28 22:11:33,854 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 23 [2018-01-28 22:11:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:33,854 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2018-01-28 22:11:33,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:11:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-01-28 22:11:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 22:11:33,855 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:33,856 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] [2018-01-28 22:11:33,856 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash -724324522, now seen corresponding path program 1 times [2018-01-28 22:11:33,856 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:33,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:33,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:33,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:33,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:33,906 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 22:11:33,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:33,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:33,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:11:33,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:11:33,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:11:33,907 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 3 states. [2018-01-28 22:11:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:33,924 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2018-01-28 22:11:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:11:33,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-28 22:11:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:33,925 INFO L225 Difference]: With dead ends: 262 [2018-01-28 22:11:33,925 INFO L226 Difference]: Without dead ends: 139 [2018-01-28 22:11:33,926 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 22:11:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-28 22:11:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-28 22:11:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-28 22:11:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-01-28 22:11:33,935 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 23 [2018-01-28 22:11:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:33,936 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-01-28 22:11:33,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:11:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-01-28 22:11:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:11:33,936 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:33,937 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] [2018-01-28 22:11:33,937 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 737120755, now seen corresponding path program 1 times [2018-01-28 22:11:33,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:33,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:33,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:33,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:33,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:33,991 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 22:11:33,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:33,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:33,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:11:33,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:11:33,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:11:33,993 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-01-28 22:11:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:34,226 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-01-28 22:11:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:11:34,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-28 22:11:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:34,228 INFO L225 Difference]: With dead ends: 185 [2018-01-28 22:11:34,228 INFO L226 Difference]: Without dead ends: 177 [2018-01-28 22:11:34,228 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 22:11:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-28 22:11:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2018-01-28 22:11:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-28 22:11:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-01-28 22:11:34,236 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 25 [2018-01-28 22:11:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:34,237 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-01-28 22:11:34,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:11:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-01-28 22:11:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:11:34,238 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:34,238 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] [2018-01-28 22:11:34,238 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 737120756, now seen corresponding path program 1 times [2018-01-28 22:11:34,239 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:34,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:34,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:34,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:34,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:34,322 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 22:11:34,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:34,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:34,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:11:34,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:11:34,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:11:34,323 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 4 states. [2018-01-28 22:11:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:34,475 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-28 22:11:34,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:11:34,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-28 22:11:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:34,476 INFO L225 Difference]: With dead ends: 210 [2018-01-28 22:11:34,476 INFO L226 Difference]: Without dead ends: 204 [2018-01-28 22:11:34,476 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 22:11:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-28 22:11:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2018-01-28 22:11:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-28 22:11:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-01-28 22:11:34,485 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 25 [2018-01-28 22:11:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:34,485 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-01-28 22:11:34,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:11:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-01-28 22:11:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 22:11:34,486 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:34,486 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, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:34,486 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash 970639538, now seen corresponding path program 1 times [2018-01-28 22:11:34,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:34,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:34,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:34,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:34,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:34,577 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 22:11:34,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:34,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:34,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:11:34,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:11:34,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:11:34,579 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 3 states. [2018-01-28 22:11:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:34,603 INFO L93 Difference]: Finished difference Result 324 states and 354 transitions. [2018-01-28 22:11:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:11:34,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-28 22:11:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:34,605 INFO L225 Difference]: With dead ends: 324 [2018-01-28 22:11:34,605 INFO L226 Difference]: Without dead ends: 202 [2018-01-28 22:11:34,607 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 22:11:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-28 22:11:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2018-01-28 22:11:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-28 22:11:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-01-28 22:11:34,616 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 39 [2018-01-28 22:11:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:34,617 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-01-28 22:11:34,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:11:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-01-28 22:11:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:11:34,619 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:34,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:34,619 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:34,619 INFO L82 PathProgramCache]: Analyzing trace with hash 746590347, now seen corresponding path program 1 times [2018-01-28 22:11:34,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:34,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:34,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:34,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:34,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:34,684 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 22:11:34,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:34,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:34,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:11:34,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:11:34,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:11:34,687 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 3 states. [2018-01-28 22:11:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:34,708 INFO L93 Difference]: Finished difference Result 333 states and 388 transitions. [2018-01-28 22:11:34,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:11:34,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-28 22:11:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:34,719 INFO L225 Difference]: With dead ends: 333 [2018-01-28 22:11:34,720 INFO L226 Difference]: Without dead ends: 183 [2018-01-28 22:11:34,721 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 22:11:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-28 22:11:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-01-28 22:11:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-28 22:11:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 209 transitions. [2018-01-28 22:11:34,729 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 209 transitions. Word has length 43 [2018-01-28 22:11:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:34,730 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 209 transitions. [2018-01-28 22:11:34,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:11:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 209 transitions. [2018-01-28 22:11:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-28 22:11:34,731 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:34,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:34,732 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:34,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1242070152, now seen corresponding path program 1 times [2018-01-28 22:11:34,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:34,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:34,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:34,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:34,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:34,858 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 22:11:34,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:34,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:11:34,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:11:34,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:11:34,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:11:34,859 INFO L87 Difference]: Start difference. First operand 183 states and 209 transitions. Second operand 5 states. [2018-01-28 22:11:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:35,104 INFO L93 Difference]: Finished difference Result 343 states and 377 transitions. [2018-01-28 22:11:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:11:35,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-01-28 22:11:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:35,106 INFO L225 Difference]: With dead ends: 343 [2018-01-28 22:11:35,106 INFO L226 Difference]: Without dead ends: 340 [2018-01-28 22:11:35,107 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 22:11:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-28 22:11:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 167. [2018-01-28 22:11:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-28 22:11:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-01-28 22:11:35,117 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 186 transitions. Word has length 45 [2018-01-28 22:11:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:35,118 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-01-28 22:11:35,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:11:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 186 transitions. [2018-01-28 22:11:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 22:11:35,119 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:35,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:35,119 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -150530920, now seen corresponding path program 1 times [2018-01-28 22:11:35,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:35,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:35,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:35,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:35,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:35,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:35,199 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 22:11:35,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:35,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:35,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:11:35,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:11:35,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:11:35,201 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. Second operand 4 states. [2018-01-28 22:11:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:35,323 INFO L93 Difference]: Finished difference Result 270 states and 298 transitions. [2018-01-28 22:11:35,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:11:35,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-28 22:11:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:35,325 INFO L225 Difference]: With dead ends: 270 [2018-01-28 22:11:35,325 INFO L226 Difference]: Without dead ends: 266 [2018-01-28 22:11:35,326 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 22:11:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-28 22:11:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 163. [2018-01-28 22:11:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-28 22:11:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2018-01-28 22:11:35,336 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 46 [2018-01-28 22:11:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:35,336 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2018-01-28 22:11:35,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:11:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2018-01-28 22:11:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 22:11:35,337 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:35,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:35,338 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -150530919, now seen corresponding path program 1 times [2018-01-28 22:11:35,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:35,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:35,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:35,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:35,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:35,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:35,444 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 22:11:35,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:35,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:35,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:11:35,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:11:35,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:11:35,445 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 4 states. [2018-01-28 22:11:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:35,582 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2018-01-28 22:11:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:11:35,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-28 22:11:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:35,584 INFO L225 Difference]: With dead ends: 258 [2018-01-28 22:11:35,585 INFO L226 Difference]: Without dead ends: 254 [2018-01-28 22:11:35,585 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 22:11:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-28 22:11:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 159. [2018-01-28 22:11:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-28 22:11:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-01-28 22:11:35,616 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 46 [2018-01-28 22:11:35,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:35,617 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-01-28 22:11:35,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:11:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-01-28 22:11:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:11:35,618 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:35,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:35,618 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash -520715123, now seen corresponding path program 1 times [2018-01-28 22:11:35,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:35,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:35,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:35,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:35,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:35,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:35,794 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 22:11:35,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:35,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:11:35,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:11:35,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:11:35,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:11:35,796 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 6 states. [2018-01-28 22:11:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:36,100 INFO L93 Difference]: Finished difference Result 281 states and 303 transitions. [2018-01-28 22:11:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:11:36,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-28 22:11:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:36,102 INFO L225 Difference]: With dead ends: 281 [2018-01-28 22:11:36,102 INFO L226 Difference]: Without dead ends: 280 [2018-01-28 22:11:36,103 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:11:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-28 22:11:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 197. [2018-01-28 22:11:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-28 22:11:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 214 transitions. [2018-01-28 22:11:36,113 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 214 transitions. Word has length 49 [2018-01-28 22:11:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:36,113 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 214 transitions. [2018-01-28 22:11:36,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:11:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 214 transitions. [2018-01-28 22:11:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-28 22:11:36,115 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:36,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:36,115 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash -520715122, now seen corresponding path program 1 times [2018-01-28 22:11:36,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:36,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:36,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:36,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:36,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:36,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:36,387 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 22:11:36,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:36,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:11:36,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:11:36,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:11:36,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:11:36,388 INFO L87 Difference]: Start difference. First operand 197 states and 214 transitions. Second operand 10 states. [2018-01-28 22:11:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:36,797 INFO L93 Difference]: Finished difference Result 350 states and 375 transitions. [2018-01-28 22:11:36,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:11:36,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-01-28 22:11:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:36,798 INFO L225 Difference]: With dead ends: 350 [2018-01-28 22:11:36,799 INFO L226 Difference]: Without dead ends: 349 [2018-01-28 22:11:36,799 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:11:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-01-28 22:11:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 197. [2018-01-28 22:11:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-28 22:11:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2018-01-28 22:11:36,811 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 49 [2018-01-28 22:11:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:36,811 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2018-01-28 22:11:36,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:11:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2018-01-28 22:11:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 22:11:36,812 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:36,812 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, 1, 1, 1, 1, 1] [2018-01-28 22:11:36,812 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash -623103946, now seen corresponding path program 1 times [2018-01-28 22:11:36,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:36,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:36,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:36,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:36,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:36,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:36,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:36,878 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 22:11:36,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:36,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:37,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:37,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-28 22:11:37,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:11:37,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:11:37,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:11:37,034 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand 7 states. [2018-01-28 22:11:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:37,505 INFO L93 Difference]: Finished difference Result 346 states and 371 transitions. [2018-01-28 22:11:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:11:37,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-28 22:11:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:37,507 INFO L225 Difference]: With dead ends: 346 [2018-01-28 22:11:37,507 INFO L226 Difference]: Without dead ends: 222 [2018-01-28 22:11:37,508 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:11:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-28 22:11:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2018-01-28 22:11:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-28 22:11:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-01-28 22:11:37,519 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 50 [2018-01-28 22:11:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:37,519 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-01-28 22:11:37,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:11:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-01-28 22:11:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 22:11:37,520 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:37,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:37,520 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1908788837, now seen corresponding path program 1 times [2018-01-28 22:11:37,521 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:37,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:37,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:37,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:37,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:37,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:37,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:37,646 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 22:11:37,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:37,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:37,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:37,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-28 22:11:37,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:11:37,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:11:37,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:37,851 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 8 states. [2018-01-28 22:11:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:38,121 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2018-01-28 22:11:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:11:38,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-28 22:11:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:38,122 INFO L225 Difference]: With dead ends: 261 [2018-01-28 22:11:38,123 INFO L226 Difference]: Without dead ends: 217 [2018-01-28 22:11:38,123 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:11:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-28 22:11:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-01-28 22:11:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-28 22:11:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-01-28 22:11:38,137 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 55 [2018-01-28 22:11:38,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:38,137 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-01-28 22:11:38,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:11:38,137 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-01-28 22:11:38,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 22:11:38,138 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:38,138 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] [2018-01-28 22:11:38,138 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:38,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1129337720, now seen corresponding path program 1 times [2018-01-28 22:11:38,139 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:38,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:38,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:38,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:38,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:38,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:38,206 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 22:11:38,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:38,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:38,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:11:38,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:11:38,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:11:38,207 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states. [2018-01-28 22:11:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:38,360 INFO L93 Difference]: Finished difference Result 250 states and 264 transitions. [2018-01-28 22:11:38,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:11:38,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-01-28 22:11:38,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:38,362 INFO L225 Difference]: With dead ends: 250 [2018-01-28 22:11:38,362 INFO L226 Difference]: Without dead ends: 249 [2018-01-28 22:11:38,362 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 22:11:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-28 22:11:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 216. [2018-01-28 22:11:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-28 22:11:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-01-28 22:11:38,374 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 57 [2018-01-28 22:11:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:38,375 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-01-28 22:11:38,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:11:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-01-28 22:11:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-28 22:11:38,376 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:38,376 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] [2018-01-28 22:11:38,376 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1129337721, now seen corresponding path program 1 times [2018-01-28 22:11:38,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:38,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:38,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:38,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:38,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:38,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:38,476 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 22:11:38,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:38,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:11:38,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:11:38,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:11:38,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:11:38,477 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-01-28 22:11:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:38,671 INFO L93 Difference]: Finished difference Result 362 states and 390 transitions. [2018-01-28 22:11:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:11:38,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-01-28 22:11:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:38,673 INFO L225 Difference]: With dead ends: 362 [2018-01-28 22:11:38,673 INFO L226 Difference]: Without dead ends: 361 [2018-01-28 22:11:38,673 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 22:11:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-01-28 22:11:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 281. [2018-01-28 22:11:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-28 22:11:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 306 transitions. [2018-01-28 22:11:38,684 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 306 transitions. Word has length 57 [2018-01-28 22:11:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:38,684 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 306 transitions. [2018-01-28 22:11:38,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:11:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 306 transitions. [2018-01-28 22:11:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:11:38,685 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:38,685 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] [2018-01-28 22:11:38,685 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1621308131, now seen corresponding path program 1 times [2018-01-28 22:11:38,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:38,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:38,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:38,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:38,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:38,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:38,778 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 22:11:38,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:38,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:11:38,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:11:38,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:11:38,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:11:38,779 INFO L87 Difference]: Start difference. First operand 281 states and 306 transitions. Second operand 5 states. [2018-01-28 22:11:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:39,043 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-01-28 22:11:39,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:11:39,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-01-28 22:11:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:39,046 INFO L225 Difference]: With dead ends: 333 [2018-01-28 22:11:39,046 INFO L226 Difference]: Without dead ends: 331 [2018-01-28 22:11:39,046 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 22:11:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-28 22:11:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2018-01-28 22:11:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-01-28 22:11:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 327 transitions. [2018-01-28 22:11:39,063 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 327 transitions. Word has length 60 [2018-01-28 22:11:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:39,063 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 327 transitions. [2018-01-28 22:11:39,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:11:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 327 transitions. [2018-01-28 22:11:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:11:39,064 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:39,064 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] [2018-01-28 22:11:39,065 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1621308132, now seen corresponding path program 1 times [2018-01-28 22:11:39,065 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:39,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:39,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:39,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:39,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:39,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:39,189 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 22:11:39,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:39,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:11:39,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:11:39,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:11:39,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:11:39,191 INFO L87 Difference]: Start difference. First operand 294 states and 327 transitions. Second operand 6 states. [2018-01-28 22:11:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:39,526 INFO L93 Difference]: Finished difference Result 431 states and 484 transitions. [2018-01-28 22:11:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:11:39,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-28 22:11:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:39,528 INFO L225 Difference]: With dead ends: 431 [2018-01-28 22:11:39,528 INFO L226 Difference]: Without dead ends: 429 [2018-01-28 22:11:39,528 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 22:11:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-01-28 22:11:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 321. [2018-01-28 22:11:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-01-28 22:11:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 369 transitions. [2018-01-28 22:11:39,541 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 369 transitions. Word has length 60 [2018-01-28 22:11:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:39,542 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 369 transitions. [2018-01-28 22:11:39,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:11:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 369 transitions. [2018-01-28 22:11:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:11:39,542 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:39,542 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] [2018-01-28 22:11:39,542 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash -635597717, now seen corresponding path program 1 times [2018-01-28 22:11:39,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:39,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:39,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:39,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:39,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:39,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:39,739 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 22:11:39,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:39,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:11:39,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:11:39,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:11:39,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:39,740 INFO L87 Difference]: Start difference. First operand 321 states and 369 transitions. Second operand 8 states. [2018-01-28 22:11:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:40,429 INFO L93 Difference]: Finished difference Result 479 states and 552 transitions. [2018-01-28 22:11:40,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:11:40,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-01-28 22:11:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:40,432 INFO L225 Difference]: With dead ends: 479 [2018-01-28 22:11:40,432 INFO L226 Difference]: Without dead ends: 478 [2018-01-28 22:11:40,432 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:11:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-01-28 22:11:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 346. [2018-01-28 22:11:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-28 22:11:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 399 transitions. [2018-01-28 22:11:40,451 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 399 transitions. Word has length 66 [2018-01-28 22:11:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:40,452 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 399 transitions. [2018-01-28 22:11:40,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:11:40,452 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 399 transitions. [2018-01-28 22:11:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-28 22:11:40,453 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:40,453 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] [2018-01-28 22:11:40,453 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:40,453 INFO L82 PathProgramCache]: Analyzing trace with hash -635597716, now seen corresponding path program 1 times [2018-01-28 22:11:40,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:40,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:40,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:40,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:40,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:40,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:40,649 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 22:11:40,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:40,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:11:40,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:11:40,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:11:40,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:40,650 INFO L87 Difference]: Start difference. First operand 346 states and 399 transitions. Second operand 8 states. [2018-01-28 22:11:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:41,029 INFO L93 Difference]: Finished difference Result 525 states and 613 transitions. [2018-01-28 22:11:41,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:11:41,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-01-28 22:11:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:41,031 INFO L225 Difference]: With dead ends: 525 [2018-01-28 22:11:41,031 INFO L226 Difference]: Without dead ends: 452 [2018-01-28 22:11:41,032 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 22:11:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-01-28 22:11:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 344. [2018-01-28 22:11:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-28 22:11:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 395 transitions. [2018-01-28 22:11:41,045 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 395 transitions. Word has length 66 [2018-01-28 22:11:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:41,045 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 395 transitions. [2018-01-28 22:11:41,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:11:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 395 transitions. [2018-01-28 22:11:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 22:11:41,046 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:41,046 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:41,046 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1382363295, now seen corresponding path program 1 times [2018-01-28 22:11:41,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:41,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:41,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:41,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:41,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:41,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:41,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:41,303 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 22:11:41,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:41,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:41,518 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 22:11:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 22:11:41,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:41,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-28 22:11:41,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 22:11:41,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 22:11:41,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-01-28 22:11:41,573 INFO L87 Difference]: Start difference. First operand 344 states and 395 transitions. Second operand 14 states. [2018-01-28 22:11:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:42,140 INFO L93 Difference]: Finished difference Result 401 states and 454 transitions. [2018-01-28 22:11:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:11:42,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-01-28 22:11:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:42,143 INFO L225 Difference]: With dead ends: 401 [2018-01-28 22:11:42,143 INFO L226 Difference]: Without dead ends: 398 [2018-01-28 22:11:42,143 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=289, Unknown=1, NotChecked=36, Total=420 [2018-01-28 22:11:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-28 22:11:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 359. [2018-01-28 22:11:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-01-28 22:11:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 410 transitions. [2018-01-28 22:11:42,156 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 410 transitions. Word has length 69 [2018-01-28 22:11:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:42,157 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 410 transitions. [2018-01-28 22:11:42,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 22:11:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 410 transitions. [2018-01-28 22:11:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-28 22:11:42,157 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:42,158 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, 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 22:11:42,158 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1845336277, now seen corresponding path program 1 times [2018-01-28 22:11:42,158 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:42,158 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:42,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:42,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:42,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:42,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:42,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:42,251 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 22:11:42,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:42,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:42,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:42,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-01-28 22:11:42,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:11:42,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:11:42,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:42,387 INFO L87 Difference]: Start difference. First operand 359 states and 410 transitions. Second operand 8 states. [2018-01-28 22:11:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:42,535 INFO L93 Difference]: Finished difference Result 462 states and 530 transitions. [2018-01-28 22:11:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:11:42,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-28 22:11:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:42,537 INFO L225 Difference]: With dead ends: 462 [2018-01-28 22:11:42,537 INFO L226 Difference]: Without dead ends: 394 [2018-01-28 22:11:42,538 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:11:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-01-28 22:11:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 374. [2018-01-28 22:11:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-01-28 22:11:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 443 transitions. [2018-01-28 22:11:42,561 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 443 transitions. Word has length 72 [2018-01-28 22:11:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:42,562 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 443 transitions. [2018-01-28 22:11:42,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:11:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 443 transitions. [2018-01-28 22:11:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:11:42,563 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:42,563 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:42,564 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 96824994, now seen corresponding path program 1 times [2018-01-28 22:11:42,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:42,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:42,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:42,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:42,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:42,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:42,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:42,708 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 22:11:42,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:42,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:42,794 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 22:11:42,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:42,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:42,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-28 22:11:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:42,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:42,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-01-28 22:11:42,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:11:42,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:11:42,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:42,864 INFO L87 Difference]: Start difference. First operand 374 states and 443 transitions. Second operand 8 states. [2018-01-28 22:11:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:43,233 INFO L93 Difference]: Finished difference Result 427 states and 488 transitions. [2018-01-28 22:11:43,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:11:43,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-01-28 22:11:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:43,236 INFO L225 Difference]: With dead ends: 427 [2018-01-28 22:11:43,236 INFO L226 Difference]: Without dead ends: 426 [2018-01-28 22:11:43,236 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:11:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-01-28 22:11:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 373. [2018-01-28 22:11:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-01-28 22:11:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 441 transitions. [2018-01-28 22:11:43,257 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 441 transitions. Word has length 73 [2018-01-28 22:11:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:43,257 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 441 transitions. [2018-01-28 22:11:43,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:11:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 441 transitions. [2018-01-28 22:11:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:11:43,258 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:43,258 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:43,258 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash 96824995, now seen corresponding path program 1 times [2018-01-28 22:11:43,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:43,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:43,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:43,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:43,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:43,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:43,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:43,434 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 22:11:43,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:43,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:43,485 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 22:11:43,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:43,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:43,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:11:43,560 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 19 treesize of output 14 [2018-01-28 22:11:43,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:43,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:43,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-28 22:11:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:43,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:43,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-28 22:11:43,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:11:43,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:11:43,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:11:43,625 INFO L87 Difference]: Start difference. First operand 373 states and 441 transitions. Second operand 12 states. [2018-01-28 22:11:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:43,963 INFO L93 Difference]: Finished difference Result 508 states and 591 transitions. [2018-01-28 22:11:43,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:11:43,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-01-28 22:11:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:43,966 INFO L225 Difference]: With dead ends: 508 [2018-01-28 22:11:43,966 INFO L226 Difference]: Without dead ends: 507 [2018-01-28 22:11:43,966 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:11:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-01-28 22:11:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 372. [2018-01-28 22:11:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-01-28 22:11:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 439 transitions. [2018-01-28 22:11:43,986 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 439 transitions. Word has length 73 [2018-01-28 22:11:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:43,987 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 439 transitions. [2018-01-28 22:11:43,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:11:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 439 transitions. [2018-01-28 22:11:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:11:43,988 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:43,988 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:43,988 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:43,989 INFO L82 PathProgramCache]: Analyzing trace with hash 33695114, now seen corresponding path program 1 times [2018-01-28 22:11:43,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:43,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:43,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:43,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:43,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:44,002 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:44,002 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:44,002 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:44,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:44,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:44,093 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 22:11:44,100 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 22:11:44,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,113 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 22:11:44,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-28 22:11:44,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 22:11:44,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-28 22:11:44,228 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 22:11:44,234 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 22:11:44,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,274 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 22:11:44,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,290 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 22:11:44,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-28 22:11:44,335 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 22:11:44,345 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 24 treesize of output 17 [2018-01-28 22:11:44,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,360 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 17 treesize of output 10 [2018-01-28 22:11:44,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,375 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 22:11:44,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:11:44,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-28 22:11:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:44,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:44,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-01-28 22:11:44,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:11:44,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:11:44,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:11:44,483 INFO L87 Difference]: Start difference. First operand 372 states and 439 transitions. Second operand 9 states. [2018-01-28 22:11:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:44,794 INFO L93 Difference]: Finished difference Result 402 states and 472 transitions. [2018-01-28 22:11:44,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:11:44,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-01-28 22:11:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:44,795 INFO L225 Difference]: With dead ends: 402 [2018-01-28 22:11:44,795 INFO L226 Difference]: Without dead ends: 401 [2018-01-28 22:11:44,796 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:11:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-01-28 22:11:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 371. [2018-01-28 22:11:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-01-28 22:11:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 437 transitions. [2018-01-28 22:11:44,815 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 437 transitions. Word has length 73 [2018-01-28 22:11:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:44,815 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 437 transitions. [2018-01-28 22:11:44,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:11:44,816 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 437 transitions. [2018-01-28 22:11:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-28 22:11:44,816 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:44,817 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:44,817 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 33695115, now seen corresponding path program 1 times [2018-01-28 22:11:44,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:44,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:44,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:44,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:44,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:44,830 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:44,830 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:44,830 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:44,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:44,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:44,896 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 22:11:44,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:11:44,934 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 22:11:44,936 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 22:11:44,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,951 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 22:11:44,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 8 treesize of output 7 [2018-01-28 22:11:44,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:44,966 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 22:11:44,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-28 22:11:44,995 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 22:11:44,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-28 22:11:45,134 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 22:11:45,142 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 22:11:45,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,162 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 22:11:45,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,191 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 22:11:45,195 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 33 treesize of output 32 [2018-01-28 22:11:45,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,223 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 22:11:45,223 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-28 22:11:45,266 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 22:11:45,279 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 22:11:45,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,299 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 22:11:45,309 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 22:11:45,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,323 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 22:11:45,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,335 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 22:11:45,336 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:45,351 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 22:11:45,351 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-28 22:11:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:45,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:45,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-01-28 22:11:45,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 22:11:45,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 22:11:45,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2018-01-28 22:11:45,394 INFO L87 Difference]: Start difference. First operand 371 states and 437 transitions. Second operand 11 states. [2018-01-28 22:11:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:45,708 INFO L93 Difference]: Finished difference Result 524 states and 618 transitions. [2018-01-28 22:11:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:11:45,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-01-28 22:11:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:45,744 INFO L225 Difference]: With dead ends: 524 [2018-01-28 22:11:45,745 INFO L226 Difference]: Without dead ends: 523 [2018-01-28 22:11:45,745 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=269, Unknown=4, NotChecked=0, Total=380 [2018-01-28 22:11:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-01-28 22:11:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 344. [2018-01-28 22:11:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-28 22:11:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 409 transitions. [2018-01-28 22:11:45,757 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 409 transitions. Word has length 73 [2018-01-28 22:11:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:45,757 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 409 transitions. [2018-01-28 22:11:45,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 22:11:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 409 transitions. [2018-01-28 22:11:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-28 22:11:45,758 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:45,758 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:45,758 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash -806409671, now seen corresponding path program 1 times [2018-01-28 22:11:45,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:45,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:45,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:45,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:45,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:45,767 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:45,767 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:45,767 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:45,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:45,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:45,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:45,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-01-28 22:11:45,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:11:45,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:11:45,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:11:45,889 INFO L87 Difference]: Start difference. First operand 344 states and 409 transitions. Second operand 6 states. [2018-01-28 22:11:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:45,935 INFO L93 Difference]: Finished difference Result 678 states and 809 transitions. [2018-01-28 22:11:45,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:11:45,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-01-28 22:11:45,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:45,937 INFO L225 Difference]: With dead ends: 678 [2018-01-28 22:11:45,937 INFO L226 Difference]: Without dead ends: 406 [2018-01-28 22:11:45,938 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:11:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-01-28 22:11:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 386. [2018-01-28 22:11:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-01-28 22:11:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 451 transitions. [2018-01-28 22:11:45,956 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 451 transitions. Word has length 79 [2018-01-28 22:11:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:45,956 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 451 transitions. [2018-01-28 22:11:45,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:11:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 451 transitions. [2018-01-28 22:11:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 22:11:45,957 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:45,957 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:45,958 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1985849206, now seen corresponding path program 1 times [2018-01-28 22:11:45,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:45,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:45,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:45,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:45,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:45,972 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:45,972 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:45,973 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:45,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:46,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:46,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:46,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:46,047 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 22:11:46,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:46,062 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 22:11:46,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:46,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:46,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-28 22:11:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:46,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:46,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-01-28 22:11:46,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:11:46,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:11:46,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:11:46,201 INFO L87 Difference]: Start difference. First operand 386 states and 451 transitions. Second operand 6 states. [2018-01-28 22:11:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:46,418 INFO L93 Difference]: Finished difference Result 546 states and 629 transitions. [2018-01-28 22:11:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:11:46,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-01-28 22:11:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:46,420 INFO L225 Difference]: With dead ends: 546 [2018-01-28 22:11:46,420 INFO L226 Difference]: Without dead ends: 545 [2018-01-28 22:11:46,421 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-01-28 22:11:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 402. [2018-01-28 22:11:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-01-28 22:11:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 469 transitions. [2018-01-28 22:11:46,443 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 469 transitions. Word has length 81 [2018-01-28 22:11:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:46,443 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 469 transitions. [2018-01-28 22:11:46,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:11:46,444 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 469 transitions. [2018-01-28 22:11:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-28 22:11:46,444 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:46,445 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, 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] [2018-01-28 22:11:46,445 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash 248738886, now seen corresponding path program 1 times [2018-01-28 22:11:46,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:46,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:46,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:46,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:46,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:46,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:46,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:46,518 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 22:11:46,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:46,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-28 22:11:46,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:46,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-28 22:11:46,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:11:46,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:11:46,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:11:46,596 INFO L87 Difference]: Start difference. First operand 402 states and 469 transitions. Second operand 7 states. [2018-01-28 22:11:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:46,849 INFO L93 Difference]: Finished difference Result 633 states and 739 transitions. [2018-01-28 22:11:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:11:46,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-01-28 22:11:46,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:46,852 INFO L225 Difference]: With dead ends: 633 [2018-01-28 22:11:46,852 INFO L226 Difference]: Without dead ends: 375 [2018-01-28 22:11:46,853 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:11:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-28 22:11:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2018-01-28 22:11:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-28 22:11:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 421 transitions. [2018-01-28 22:11:46,871 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 421 transitions. Word has length 84 [2018-01-28 22:11:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:46,872 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 421 transitions. [2018-01-28 22:11:46,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:11:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 421 transitions. [2018-01-28 22:11:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-28 22:11:46,873 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:46,873 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:46,873 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1554252231, now seen corresponding path program 1 times [2018-01-28 22:11:46,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:46,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:46,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:46,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:46,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:46,885 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:46,885 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:46,885 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:46,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:46,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:11:47,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:47,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:11:47,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:11:47,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:11:47,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:11:47,015 INFO L87 Difference]: Start difference. First operand 363 states and 421 transitions. Second operand 6 states. [2018-01-28 22:11:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:47,265 INFO L93 Difference]: Finished difference Result 409 states and 473 transitions. [2018-01-28 22:11:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:11:47,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-01-28 22:11:47,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:47,267 INFO L225 Difference]: With dead ends: 409 [2018-01-28 22:11:47,267 INFO L226 Difference]: Without dead ends: 408 [2018-01-28 22:11:47,268 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:11:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-28 22:11:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 363. [2018-01-28 22:11:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-28 22:11:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 419 transitions. [2018-01-28 22:11:47,288 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 419 transitions. Word has length 84 [2018-01-28 22:11:47,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:47,289 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 419 transitions. [2018-01-28 22:11:47,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:11:47,289 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 419 transitions. [2018-01-28 22:11:47,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-28 22:11:47,290 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:47,290 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:47,290 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:47,290 INFO L82 PathProgramCache]: Analyzing trace with hash 839281588, now seen corresponding path program 1 times [2018-01-28 22:11:47,291 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:47,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:47,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:47,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:47,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:47,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:47,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:47,370 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:11:47,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:47,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:47,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:47,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-28 22:11:47,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:11:47,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:11:47,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:11:47,535 INFO L87 Difference]: Start difference. First operand 363 states and 419 transitions. Second operand 9 states. [2018-01-28 22:11:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:47,680 INFO L93 Difference]: Finished difference Result 374 states and 429 transitions. [2018-01-28 22:11:47,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:11:47,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-01-28 22:11:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:47,683 INFO L225 Difference]: With dead ends: 374 [2018-01-28 22:11:47,683 INFO L226 Difference]: Without dead ends: 371 [2018-01-28 22:11:47,683 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:11:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-28 22:11:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 355. [2018-01-28 22:11:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-01-28 22:11:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 409 transitions. [2018-01-28 22:11:47,703 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 409 transitions. Word has length 87 [2018-01-28 22:11:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:47,703 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 409 transitions. [2018-01-28 22:11:47,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:11:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 409 transitions. [2018-01-28 22:11:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-28 22:11:47,704 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:47,704 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:47,704 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash -137493737, now seen corresponding path program 1 times [2018-01-28 22:11:47,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:47,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:47,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:47,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:47,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:47,713 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:47,714 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:47,714 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:47,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:47,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 22:11:47,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:47,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:11:47,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:11:47,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:11:47,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:11:47,811 INFO L87 Difference]: Start difference. First operand 355 states and 409 transitions. Second operand 7 states. [2018-01-28 22:11:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:47,949 INFO L93 Difference]: Finished difference Result 388 states and 450 transitions. [2018-01-28 22:11:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:11:47,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-01-28 22:11:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:47,950 INFO L225 Difference]: With dead ends: 388 [2018-01-28 22:11:47,950 INFO L226 Difference]: Without dead ends: 387 [2018-01-28 22:11:47,951 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:11:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-28 22:11:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 352. [2018-01-28 22:11:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-01-28 22:11:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 404 transitions. [2018-01-28 22:11:47,963 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 404 transitions. Word has length 89 [2018-01-28 22:11:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:47,964 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 404 transitions. [2018-01-28 22:11:47,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:11:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 404 transitions. [2018-01-28 22:11:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-28 22:11:47,964 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:47,964 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:47,964 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash 32662798, now seen corresponding path program 1 times [2018-01-28 22:11:47,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:47,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:47,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:47,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:47,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:47,973 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:47,973 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:47,973 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:47,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:48,011 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:48,073 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 22:11:48,081 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 22:11:48,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,100 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 22:11:48,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-28 22:11:48,166 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 22:11:48,168 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 22:11:48,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-28 22:11:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:48,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:48,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:11:48,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:11:48,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:11:48,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:11:48,214 INFO L87 Difference]: Start difference. First operand 352 states and 404 transitions. Second operand 8 states. [2018-01-28 22:11:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:48,444 INFO L93 Difference]: Finished difference Result 394 states and 438 transitions. [2018-01-28 22:11:48,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:11:48,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-01-28 22:11:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:48,446 INFO L225 Difference]: With dead ends: 394 [2018-01-28 22:11:48,446 INFO L226 Difference]: Without dead ends: 393 [2018-01-28 22:11:48,446 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 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 22:11:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-01-28 22:11:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 356. [2018-01-28 22:11:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-01-28 22:11:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 410 transitions. [2018-01-28 22:11:48,466 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 410 transitions. Word has length 90 [2018-01-28 22:11:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:48,467 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 410 transitions. [2018-01-28 22:11:48,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:11:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 410 transitions. [2018-01-28 22:11:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-28 22:11:48,468 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:48,468 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:48,468 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:48,468 INFO L82 PathProgramCache]: Analyzing trace with hash 32662799, now seen corresponding path program 1 times [2018-01-28 22:11:48,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:48,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:48,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:48,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:48,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:48,479 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:48,479 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:48,480 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:48,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:48,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:48,570 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 22:11:48,572 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 22:11:48,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,584 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 22:11:48,586 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 22:11:48,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,595 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 22:11:48,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-01-28 22:11:48,636 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 23 treesize of output 19 [2018-01-28 22:11:48,638 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 19 treesize of output 11 [2018-01-28 22:11:48,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,647 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 33 treesize of output 25 [2018-01-28 22:11:48,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-28 22:11:48,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:48,658 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 22:11:48,658 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-01-28 22:11:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:48,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:48,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 22:11:48,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 22:11:48,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 22:11:48,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:11:48,717 INFO L87 Difference]: Start difference. First operand 356 states and 410 transitions. Second operand 14 states. [2018-01-28 22:11:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:49,372 INFO L93 Difference]: Finished difference Result 489 states and 560 transitions. [2018-01-28 22:11:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 22:11:49,372 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-01-28 22:11:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:49,374 INFO L225 Difference]: With dead ends: 489 [2018-01-28 22:11:49,374 INFO L226 Difference]: Without dead ends: 488 [2018-01-28 22:11:49,374 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2018-01-28 22:11:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-01-28 22:11:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 356. [2018-01-28 22:11:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-01-28 22:11:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 409 transitions. [2018-01-28 22:11:49,388 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 409 transitions. Word has length 90 [2018-01-28 22:11:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:49,388 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 409 transitions. [2018-01-28 22:11:49,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 22:11:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 409 transitions. [2018-01-28 22:11:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-28 22:11:49,389 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:49,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:49,389 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1937018596, now seen corresponding path program 1 times [2018-01-28 22:11:49,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:49,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:49,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:49,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:49,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:49,396 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:49,396 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:49,396 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:49,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:49,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:49,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:49,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:49,570 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 22:11:49,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:49,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:49,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-28 22:11:49,606 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 22:11:49,608 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 22:11:49,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:49,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:49,614 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 22:11:49,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-01-28 22:11:49,670 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 22:11:49,675 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 22:11:49,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:11:49,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:11:49,684 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 22:11:49,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-28 22:11:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:49,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:49,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-28 22:11:49,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 22:11:49,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 22:11:49,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:11:49,754 INFO L87 Difference]: Start difference. First operand 356 states and 409 transitions. Second operand 14 states. [2018-01-28 22:11:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:50,577 INFO L93 Difference]: Finished difference Result 514 states and 571 transitions. [2018-01-28 22:11:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:11:50,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-01-28 22:11:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:50,579 INFO L225 Difference]: With dead ends: 514 [2018-01-28 22:11:50,579 INFO L226 Difference]: Without dead ends: 508 [2018-01-28 22:11:50,580 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2018-01-28 22:11:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-01-28 22:11:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 356. [2018-01-28 22:11:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-01-28 22:11:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 408 transitions. [2018-01-28 22:11:50,600 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 408 transitions. Word has length 93 [2018-01-28 22:11:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:50,600 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 408 transitions. [2018-01-28 22:11:50,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 22:11:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 408 transitions. [2018-01-28 22:11:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-28 22:11:50,601 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:50,601 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:50,601 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:50,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1900018942, now seen corresponding path program 1 times [2018-01-28 22:11:50,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:50,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:50,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:50,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:50,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:50,611 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:50,611 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:50,611 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:50,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:50,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-28 22:11:50,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:50,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:11:50,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:11:50,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:11:50,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:11:50,699 INFO L87 Difference]: Start difference. First operand 356 states and 408 transitions. Second operand 4 states. [2018-01-28 22:11:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:50,774 INFO L93 Difference]: Finished difference Result 378 states and 438 transitions. [2018-01-28 22:11:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:11:50,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-01-28 22:11:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:50,776 INFO L225 Difference]: With dead ends: 378 [2018-01-28 22:11:50,776 INFO L226 Difference]: Without dead ends: 376 [2018-01-28 22:11:50,777 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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 22:11:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-01-28 22:11:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 354. [2018-01-28 22:11:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-01-28 22:11:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 399 transitions. [2018-01-28 22:11:50,791 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 399 transitions. Word has length 93 [2018-01-28 22:11:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:50,792 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 399 transitions. [2018-01-28 22:11:50,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:11:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 399 transitions. [2018-01-28 22:11:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-28 22:11:50,793 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:50,793 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:50,793 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1900018941, now seen corresponding path program 1 times [2018-01-28 22:11:50,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:50,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:50,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:50,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:50,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:50,803 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:50,803 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:50,804 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:50,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:50,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:50,868 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 22:11:50,875 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 22:11:50,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,885 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 22:11:50,887 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 22:11:50,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,897 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 22:11:50,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-28 22:11:50,930 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 23 treesize of output 19 [2018-01-28 22:11:50,943 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 19 treesize of output 11 [2018-01-28 22:11:50,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-28 22:11:50,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-28 22:11:50,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:50,971 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 22:11:50,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2018-01-28 22:11:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:51,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:51,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:11:51,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:11:51,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:11:51,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:11:51,039 INFO L87 Difference]: Start difference. First operand 354 states and 399 transitions. Second operand 10 states. [2018-01-28 22:11:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:51,358 INFO L93 Difference]: Finished difference Result 396 states and 437 transitions. [2018-01-28 22:11:51,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:11:51,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-01-28 22:11:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:51,359 INFO L225 Difference]: With dead ends: 396 [2018-01-28 22:11:51,359 INFO L226 Difference]: Without dead ends: 395 [2018-01-28 22:11:51,359 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-01-28 22:11:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-01-28 22:11:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 357. [2018-01-28 22:11:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-01-28 22:11:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 402 transitions. [2018-01-28 22:11:51,373 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 402 transitions. Word has length 93 [2018-01-28 22:11:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:51,374 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 402 transitions. [2018-01-28 22:11:51,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:11:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 402 transitions. [2018-01-28 22:11:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-28 22:11:51,374 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:51,374 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:51,374 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:51,375 INFO L82 PathProgramCache]: Analyzing trace with hash -90158155, now seen corresponding path program 1 times [2018-01-28 22:11:51,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:51,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:51,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:51,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:51,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:51,382 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:51,382 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:51,382 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:51,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:51,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:51,517 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 22:11:51,519 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 22:11:51,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:51,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:51,528 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 22:11:51,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-28 22:11:51,561 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 22 treesize of output 16 [2018-01-28 22:11:51,563 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 16 treesize of output 7 [2018-01-28 22:11:51,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:51,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:51,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:51,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-01-28 22:11:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:51,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:11:51,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 22:11:51,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 22:11:51,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 22:11:51,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:11:51,663 INFO L87 Difference]: Start difference. First operand 357 states and 402 transitions. Second operand 14 states. [2018-01-28 22:11:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:52,633 INFO L93 Difference]: Finished difference Result 706 states and 795 transitions. [2018-01-28 22:11:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-28 22:11:52,633 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2018-01-28 22:11:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:52,635 INFO L225 Difference]: With dead ends: 706 [2018-01-28 22:11:52,635 INFO L226 Difference]: Without dead ends: 705 [2018-01-28 22:11:52,636 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=480, Invalid=1326, Unknown=0, NotChecked=0, Total=1806 [2018-01-28 22:11:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-01-28 22:11:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 418. [2018-01-28 22:11:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-01-28 22:11:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 473 transitions. [2018-01-28 22:11:52,653 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 473 transitions. Word has length 96 [2018-01-28 22:11:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:52,653 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 473 transitions. [2018-01-28 22:11:52,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 22:11:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 473 transitions. [2018-01-28 22:11:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-28 22:11:52,654 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:52,654 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:52,654 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:52,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1469681024, now seen corresponding path program 1 times [2018-01-28 22:11:52,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:52,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:52,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:52,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:52,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:52,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:52,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:52,795 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:11:52,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:52,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:52,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:52,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:11:52,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:11:52,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:11:52,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:11:52,907 INFO L87 Difference]: Start difference. First operand 418 states and 473 transitions. Second operand 10 states. [2018-01-28 22:11:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:53,011 INFO L93 Difference]: Finished difference Result 692 states and 784 transitions. [2018-01-28 22:11:53,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 22:11:53,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-01-28 22:11:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:53,014 INFO L225 Difference]: With dead ends: 692 [2018-01-28 22:11:53,014 INFO L226 Difference]: Without dead ends: 573 [2018-01-28 22:11:53,015 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:11:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-28 22:11:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 534. [2018-01-28 22:11:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-01-28 22:11:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 593 transitions. [2018-01-28 22:11:53,036 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 593 transitions. Word has length 97 [2018-01-28 22:11:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:53,036 INFO L432 AbstractCegarLoop]: Abstraction has 534 states and 593 transitions. [2018-01-28 22:11:53,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:11:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 593 transitions. [2018-01-28 22:11:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:11:53,037 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:53,037 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:11:53,037 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash 630997827, now seen corresponding path program 1 times [2018-01-28 22:11:53,038 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:53,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:53,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:53,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:53,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:53,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:11:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:53,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:11:53,497 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:11:53,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:53,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:53,586 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 22:11:53,587 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 22:11:53,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,597 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 22:11:53,598 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 22:11:53,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-28 22:11:53,626 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 22:11:53,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,629 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 22:11:53,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,643 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 22:11:53,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,645 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 22:11:53,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-01-28 22:11:53,683 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 22:11:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,691 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 22:11:53,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,711 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 22:11:53,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,716 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 22:11:53,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-01-28 22:11:53,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,787 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 22:11:53,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-01-28 22:11:53,858 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 22:11:53,860 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 22:11:53,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,882 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 22:11:53,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 10 treesize of output 9 [2018-01-28 22:11:53,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-28 22:11:53,938 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 22:11:53,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,942 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 22:11:53,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,972 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 22:11:53,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:53,974 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 22:11:53,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:53,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:85 [2018-01-28 22:11:54,041 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 22:11:54,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,048 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 22:11:54,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,086 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 22:11:54,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,093 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 22:11:54,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-28 22:11:54,188 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 22:11:54,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,200 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 22:11:54,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,249 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 22:11:54,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,259 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 22:11:54,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:117 [2018-01-28 22:11:54,355 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 22:11:54,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,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, 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 22:11:54,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,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, 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 22:11:54,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,454 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 22:11:54,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:155, output treesize:117 [2018-01-28 22:11:54,509 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 22:11:54,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,515 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 22:11:54,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,569 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 85 [2018-01-28 22:11:54,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,576 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 22:11:54,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:159 [2018-01-28 22:11:54,706 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 277 treesize of output 239 [2018-01-28 22:11:54,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,712 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,723 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 22:11:54,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,786 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:11:54,787 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 236 treesize of output 218 [2018-01-28 22:11:54,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,801 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 22:11:54,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:299, output treesize:237 [2018-01-28 22:11:54,959 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 22:11:54,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 169 [2018-01-28 22:11:54,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:54,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:54,985 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 192 [2018-01-28 22:11:54,985 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 22:11:55,001 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 22:11:55,019 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 22:11:55,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,025 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:11:55,028 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 51 treesize of output 94 [2018-01-28 22:11:55,029 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:55,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:55,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-01-28 22:11:55,041 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:55,043 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:55,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:55,049 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:251, output treesize:13 [2018-01-28 22:11:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:55,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:11:55,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-01-28 22:11:55,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-28 22:11:55,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-28 22:11:55,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 22:11:55,177 INFO L87 Difference]: Start difference. First operand 534 states and 593 transitions. Second operand 34 states. [2018-01-28 22:11:56,123 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-01-28 22:11:56,471 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 111 DAG size of output 82 [2018-01-28 22:11:56,629 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 113 DAG size of output 84 [2018-01-28 22:11:57,012 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 83 DAG size of output 79 [2018-01-28 22:11:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:57,427 INFO L93 Difference]: Finished difference Result 721 states and 807 transitions. [2018-01-28 22:11:57,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-28 22:11:57,427 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-01-28 22:11:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:57,429 INFO L225 Difference]: With dead ends: 721 [2018-01-28 22:11:57,429 INFO L226 Difference]: Without dead ends: 644 [2018-01-28 22:11:57,430 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=656, Invalid=3004, Unknown=0, NotChecked=0, Total=3660 [2018-01-28 22:11:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-01-28 22:11:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 553. [2018-01-28 22:11:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-01-28 22:11:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 613 transitions. [2018-01-28 22:11:57,454 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 613 transitions. Word has length 99 [2018-01-28 22:11:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:57,454 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 613 transitions. [2018-01-28 22:11:57,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-28 22:11:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 613 transitions. [2018-01-28 22:11:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:11:57,455 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:57,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:57,455 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:57,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1546904374, now seen corresponding path program 1 times [2018-01-28 22:11:57,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:57,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:57,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:57,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:57,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:57,464 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:57,464 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:57,464 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:57,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:57,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:57,558 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 22:11:57,560 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 22:11:57,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:57,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:57,565 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 22:11:57,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-28 22:11:57,607 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 22:11:57,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-28 22:11:57,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:57,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:57,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:57,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-01-28 22:11:57,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:57,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 22:11:57,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:57,677 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 22:11:57,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-28 22:11:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:11:57,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:11:57,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-01-28 22:11:57,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:11:57,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:11:57,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:11:57,751 INFO L87 Difference]: Start difference. First operand 553 states and 613 transitions. Second operand 17 states. [2018-01-28 22:11:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:11:58,527 INFO L93 Difference]: Finished difference Result 691 states and 773 transitions. [2018-01-28 22:11:58,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:11:58,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-01-28 22:11:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:11:58,529 INFO L225 Difference]: With dead ends: 691 [2018-01-28 22:11:58,529 INFO L226 Difference]: Without dead ends: 690 [2018-01-28 22:11:58,530 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 22:11:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-01-28 22:11:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 553. [2018-01-28 22:11:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-01-28 22:11:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 613 transitions. [2018-01-28 22:11:58,553 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 613 transitions. Word has length 99 [2018-01-28 22:11:58,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:11:58,553 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 613 transitions. [2018-01-28 22:11:58,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:11:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 613 transitions. [2018-01-28 22:11:58,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:11:58,554 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:11:58,554 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:58,554 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:11:58,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1370178326, now seen corresponding path program 1 times [2018-01-28 22:11:58,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:11:58,554 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:11:58,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:58,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:58,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:11:58,560 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:11:58,561 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:11:58,561 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:11:58,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:11:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:11:58,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:11:58,601 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 22:11:58,602 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 22:11:58,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-28 22:11:58,614 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 22:11:58,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:58,617 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 22:11:58,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-28 22:11:58,638 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 22:11:58,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:58,641 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:58,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:58,645 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 22:11:58,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-01-28 22:11:58,701 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 22:11:58,703 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 33 treesize of output 32 [2018-01-28 22:11:58,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:58,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-28 22:11:58,771 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:11:58,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-01-28 22:11:58,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:58,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 65 [2018-01-28 22:11:58,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-28 22:11:58,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:11:58,894 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 3 xjuncts. [2018-01-28 22:11:58,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:149 [2018-01-28 22:11:59,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 69 [2018-01-28 22:11:59,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,021 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 66 treesize of output 77 [2018-01-28 22:11:59,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:11:59,129 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 58 treesize of output 60 [2018-01-28 22:11:59,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,133 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 55 treesize of output 64 [2018-01-28 22:11:59,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:11:59,232 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 58 treesize of output 60 [2018-01-28 22:11:59,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,237 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 55 treesize of output 64 [2018-01-28 22:11:59,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,268 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:11:59,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-28 22:11:59,330 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:188, output treesize:176 [2018-01-28 22:11:59,408 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 86 treesize of output 86 [2018-01-28 22:11:59,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,416 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:11:59,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,418 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:11:59,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,419 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:11:59,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 103 [2018-01-28 22:11:59,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:11:59,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,509 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 75 treesize of output 87 [2018-01-28 22:11:59,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:11:59,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 77 [2018-01-28 22:11:59,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,672 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 68 treesize of output 78 [2018-01-28 22:11:59,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,806 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 73 treesize of output 77 [2018-01-28 22:11:59,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,813 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 68 treesize of output 78 [2018-01-28 22:11:59,813 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,852 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:11:59,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-28 22:11:59,896 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:233, output treesize:176 [2018-01-28 22:11:59,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 81 [2018-01-28 22:11:59,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:11:59,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69 [2018-01-28 22:11:59,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 22:11:59,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:00,036 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 85 treesize of output 82 [2018-01-28 22:12:00,038 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 22:12:00,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,052 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 91 treesize of output 88 [2018-01-28 22:12:00,054 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 22:12:00,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,067 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,069 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 81 treesize of output 78 [2018-01-28 22:12:00,070 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 22:12:00,071 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,082 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,084 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 89 treesize of output 86 [2018-01-28 22:12:00,086 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 22:12:00,086 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,099 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2018-01-28 22:12:00,182 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 22:12:00,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 81 [2018-01-28 22:12:00,217 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,245 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:00,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 68 [2018-01-28 22:12:00,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2018-01-28 22:12:00,326 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,337 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:00,370 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:287, output treesize:155 [2018-01-28 22:12:00,490 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 89 treesize of output 79 [2018-01-28 22:12:00,492 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 48 treesize of output 35 [2018-01-28 22:12:00,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,532 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 93 treesize of output 81 [2018-01-28 22:12:00,534 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 63 treesize of output 48 [2018-01-28 22:12:00,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:00,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:133 [2018-01-28 22:12:00,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 61 [2018-01-28 22:12:00,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,751 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-01-28 22:12:00,752 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 22:12:00,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,766 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-28 22:12:00,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,793 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 78 treesize of output 59 [2018-01-28 22:12:00,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:00,800 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2018-01-28 22:12:00,801 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:00,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-01-28 22:12:00,817 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:00,836 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:157, output treesize:5 [2018-01-28 22:12:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:00,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:12:00,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-01-28 22:12:00,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:12:00,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:12:00,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:12:00,933 INFO L87 Difference]: Start difference. First operand 553 states and 613 transitions. Second operand 21 states. [2018-01-28 22:12:02,028 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-01-28 22:12:02,201 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 105 DAG size of output 81 [2018-01-28 22:12:02,355 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-01-28 22:12:02,605 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 132 DAG size of output 105 [2018-01-28 22:12:02,885 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 137 DAG size of output 110 [2018-01-28 22:12:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:03,294 INFO L93 Difference]: Finished difference Result 774 states and 865 transitions. [2018-01-28 22:12:03,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 22:12:03,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-01-28 22:12:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:03,297 INFO L225 Difference]: With dead ends: 774 [2018-01-28 22:12:03,297 INFO L226 Difference]: Without dead ends: 773 [2018-01-28 22:12:03,297 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=327, Invalid=1743, Unknown=0, NotChecked=0, Total=2070 [2018-01-28 22:12:03,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-01-28 22:12:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 595. [2018-01-28 22:12:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-01-28 22:12:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 660 transitions. [2018-01-28 22:12:03,324 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 660 transitions. Word has length 99 [2018-01-28 22:12:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:03,324 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 660 transitions. [2018-01-28 22:12:03,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:12:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 660 transitions. [2018-01-28 22:12:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-28 22:12:03,326 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:03,326 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:03,326 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:03,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1370178325, now seen corresponding path program 1 times [2018-01-28 22:12:03,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:03,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:03,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:03,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:03,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:03,332 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:12:03,333 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:12:03,333 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:12:03,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:03,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:03,386 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 22:12:03,388 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 22:12:03,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,395 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 22:12:03,397 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 22:12:03,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-28 22:12:03,412 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 22:12:03,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,415 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 22:12:03,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,434 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 22:12:03,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,437 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 22:12:03,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-28 22:12:03,461 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 22:12:03,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,467 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 22:12:03,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,486 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 22:12:03,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,491 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 22:12:03,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-01-28 22:12:03,555 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 22:12:03,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,558 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-28 22:12:03,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,574 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 22:12:03,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,604 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 22:12:03,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,607 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-28 22:12:03,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,623 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 22:12:03,623 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,640 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-28 22:12:03,684 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 69 [2018-01-28 22:12:03,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 86 [2018-01-28 22:12:03,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-28 22:12:03,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:12:03,836 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 104 [2018-01-28 22:12:03,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,852 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 146 [2018-01-28 22:12:03,853 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:03,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 117 [2018-01-28 22:12:03,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,903 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,904 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 96 treesize of output 174 [2018-01-28 22:12:03,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,940 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,945 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:03,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 88 [2018-01-28 22:12:03,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:03,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 78 [2018-01-28 22:12:03,957 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:03,968 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-28 22:12:04,011 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:109, output treesize:306 [2018-01-28 22:12:04,093 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 113 treesize of output 107 [2018-01-28 22:12:04,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:04,115 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 110 treesize of output 139 [2018-01-28 22:12:04,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 139 [2018-01-28 22:12:04,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:04,310 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:04,310 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 150 treesize of output 192 [2018-01-28 22:12:04,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:04,507 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 166 treesize of output 146 [2018-01-28 22:12:04,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:04,511 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 153 treesize of output 172 [2018-01-28 22:12:04,512 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,542 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 119 [2018-01-28 22:12:04,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:04,643 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 130 treesize of output 171 [2018-01-28 22:12:04,644 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:04,785 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 113 treesize of output 107 [2018-01-28 22:12:04,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:04,788 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 110 treesize of output 119 [2018-01-28 22:12:04,788 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,831 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:04,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 111 [2018-01-28 22:12:04,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:04,923 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 112 treesize of output 129 [2018-01-28 22:12:04,923 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:04,950 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:05,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-28 22:12:05,010 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:384, output treesize:423 [2018-01-28 22:12:05,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 200 treesize of output 180 [2018-01-28 22:12:05,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,133 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 177 treesize of output 236 [2018-01-28 22:12:05,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:05,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 192 [2018-01-28 22:12:05,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:05,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:05,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 141 [2018-01-28 22:12:05,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,527 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 142 treesize of output 152 [2018-01-28 22:12:05,527 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:05,612 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:05,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 189 treesize of output 173 [2018-01-28 22:12:05,782 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:05,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,784 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:05,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 257 [2018-01-28 22:12:05,789 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:05,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:05,858 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 168 treesize of output 231 [2018-01-28 22:12:05,858 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:05,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 138 [2018-01-28 22:12:06,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,039 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,041 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 173 [2018-01-28 22:12:06,045 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,099 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 111 treesize of output 148 [2018-01-28 22:12:06,099 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,127 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,228 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 181 treesize of output 163 [2018-01-28 22:12:06,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 186 [2018-01-28 22:12:06,235 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,320 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,322 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 143 [2018-01-28 22:12:06,331 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:06,389 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:06,475 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 170 treesize of output 156 [2018-01-28 22:12:06,478 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 195 [2018-01-28 22:12:06,482 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,531 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-28 22:12:06,587 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:537, output treesize:423 [2018-01-28 22:12:06,594 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,599 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 225 treesize of output 169 [2018-01-28 22:12:06,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 190 [2018-01-28 22:12:06,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:06,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 158 [2018-01-28 22:12:06,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 145 [2018-01-28 22:12:06,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:06,841 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:06,985 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,988 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 134 [2018-01-28 22:12:06,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:06,997 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:06,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 94 [2018-01-28 22:12:06,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,140 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:07,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 214 treesize of output 147 [2018-01-28 22:12:07,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 114 [2018-01-28 22:12:07,153 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,174 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,175 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:07,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 121 [2018-01-28 22:12:07,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2018-01-28 22:12:07,183 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,196 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 132 [2018-01-28 22:12:07,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2018-01-28 22:12:07,303 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,314 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 113 [2018-01-28 22:12:07,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 106 [2018-01-28 22:12:07,387 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,400 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:07,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-28 22:12:07,449 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:595, output treesize:429 [2018-01-28 22:12:07,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,922 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 173 treesize of output 130 [2018-01-28 22:12:07,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,930 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 91 [2018-01-28 22:12:07,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:07,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,969 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:07,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 113 [2018-01-28 22:12:07,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:07,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:07,977 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:07,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2018-01-28 22:12:07,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:08,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2018-01-28 22:12:08,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,088 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:08,088 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:08,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-01-28 22:12:08,090 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,106 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 31 treesize of output 13 [2018-01-28 22:12:08,106 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-01-28 22:12:08,118 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,119 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:08,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-01-28 22:12:08,119 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-28 22:12:08,140 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 143 [2018-01-28 22:12:08,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2018-01-28 22:12:08,185 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,202 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 71 treesize of output 49 [2018-01-28 22:12:08,202 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,212 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 55 [2018-01-28 22:12:08,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,250 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-01-28 22:12:08,251 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:08,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:08,262 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-28 22:12:08,262 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,267 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:08,277 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:334, output treesize:13 [2018-01-28 22:12:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:08,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:12:08,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-01-28 22:12:08,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:12:08,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:12:08,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:12:08,408 INFO L87 Difference]: Start difference. First operand 595 states and 660 transitions. Second operand 21 states. [2018-01-28 22:12:09,698 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 115 DAG size of output 113 [2018-01-28 22:12:10,104 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 114 DAG size of output 114 [2018-01-28 22:12:10,265 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 112 DAG size of output 112 [2018-01-28 22:12:10,409 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 108 DAG size of output 108 [2018-01-28 22:12:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:10,513 INFO L93 Difference]: Finished difference Result 796 states and 892 transitions. [2018-01-28 22:12:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 22:12:10,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-01-28 22:12:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:10,516 INFO L225 Difference]: With dead ends: 796 [2018-01-28 22:12:10,516 INFO L226 Difference]: Without dead ends: 762 [2018-01-28 22:12:10,517 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2018-01-28 22:12:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-01-28 22:12:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 595. [2018-01-28 22:12:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-01-28 22:12:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 658 transitions. [2018-01-28 22:12:10,565 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 658 transitions. Word has length 99 [2018-01-28 22:12:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:10,565 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 658 transitions. [2018-01-28 22:12:10,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:12:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 658 transitions. [2018-01-28 22:12:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 22:12:10,566 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:10,566 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-28 22:12:10,566 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1052448057, now seen corresponding path program 1 times [2018-01-28 22:12:10,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:10,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:10,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:10,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:10,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:10,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:10,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:12:10,689 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:12:10,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:10,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:10,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:12:10,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-28 22:12:10,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:12:10,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:12:10,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:12:10,830 INFO L87 Difference]: Start difference. First operand 595 states and 658 transitions. Second operand 10 states. [2018-01-28 22:12:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:11,053 INFO L93 Difference]: Finished difference Result 606 states and 663 transitions. [2018-01-28 22:12:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:12:11,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-01-28 22:12:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:11,055 INFO L225 Difference]: With dead ends: 606 [2018-01-28 22:12:11,055 INFO L226 Difference]: Without dead ends: 603 [2018-01-28 22:12:11,056 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:12:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-01-28 22:12:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2018-01-28 22:12:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-01-28 22:12:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 660 transitions. [2018-01-28 22:12:11,084 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 660 transitions. Word has length 102 [2018-01-28 22:12:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:11,084 INFO L432 AbstractCegarLoop]: Abstraction has 597 states and 660 transitions. [2018-01-28 22:12:11,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:12:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 660 transitions. [2018-01-28 22:12:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-28 22:12:11,085 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:11,085 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:11,085 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash 349813696, now seen corresponding path program 1 times [2018-01-28 22:12:11,085 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:11,085 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:11,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:11,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:11,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:11,092 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:12:11,092 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:12:11,092 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:12:11,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:11,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:11,230 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 15 treesize of output 12 [2018-01-28 22:12:11,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-28 22:12:11,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,242 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 22:12:11,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-01-28 22:12:11,298 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 22:12:11,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 8 treesize of output 7 [2018-01-28 22:12:11,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,335 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 27 treesize of output 51 [2018-01-28 22:12:11,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:11,340 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 29 treesize of output 25 [2018-01-28 22:12:11,340 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-01-28 22:12:11,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,372 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 22:12:11,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 22:12:11,374 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:12:11,387 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:67, output treesize:46 [2018-01-28 22:12:11,566 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 27 treesize of output 23 [2018-01-28 22:12:11,608 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2018-01-28 22:12:11,609 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 22:12:11,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:11,637 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 41 treesize of output 33 [2018-01-28 22:12:11,640 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 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-28 22:12:11,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:12:11,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:12:11,649 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 37 treesize of output 29 [2018-01-28 22:12:11,655 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 26 [2018-01-28 22:12:11,656 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:11,668 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:11,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-01-28 22:12:11,696 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:109 [2018-01-28 22:12:11,932 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 39 treesize of output 35 [2018-01-28 22:12:11,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-01-28 22:12:11,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,969 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 42 treesize of output 46 [2018-01-28 22:12:11,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-01-28 22:12:11,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:11,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-28 22:12:11,999 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:12,027 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-01-28 22:12:12,027 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:12,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:12:12,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-28 22:12:12,096 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:82, output treesize:40 [2018-01-28 22:12:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:12,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:12:12,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-01-28 22:12:12,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:12:12,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:12:12,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:12:12,239 INFO L87 Difference]: Start difference. First operand 597 states and 660 transitions. Second operand 25 states. [2018-01-28 22:12:14,966 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 82 DAG size of output 60 [2018-01-28 22:12:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:15,415 INFO L93 Difference]: Finished difference Result 625 states and 686 transitions. [2018-01-28 22:12:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-28 22:12:15,416 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-01-28 22:12:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:15,417 INFO L225 Difference]: With dead ends: 625 [2018-01-28 22:12:15,418 INFO L226 Difference]: Without dead ends: 616 [2018-01-28 22:12:15,418 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=264, Invalid=2186, Unknown=0, NotChecked=0, Total=2450 [2018-01-28 22:12:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-01-28 22:12:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 596. [2018-01-28 22:12:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-01-28 22:12:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 658 transitions. [2018-01-28 22:12:15,447 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 658 transitions. Word has length 102 [2018-01-28 22:12:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:15,447 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 658 transitions. [2018-01-28 22:12:15,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:12:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 658 transitions. [2018-01-28 22:12:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-28 22:12:15,448 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:15,448 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:15,448 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1939956174, now seen corresponding path program 1 times [2018-01-28 22:12:15,448 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:15,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:15,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:15,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:15,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:15,455 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-28 22:12:15,455 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-28 22:12:15,455 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-28 22:12:15,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:15,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:15,671 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 22:12:15,673 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 22:12:15,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:15,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:15,685 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 22:12:15,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:49 [2018-01-28 22:12:15,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-01-28 22:12:15,789 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 33 treesize of output 30 [2018-01-28 22:12:15,790 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 22:12:15,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:15,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:15,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:78 [2018-01-28 22:12:16,267 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int) (v_prenex_61 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~10.base 1))) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (not (= v_prenex_61 0)) (= |c_#valid| (store (store .cse0 v_prenex_61 0) main_~x~10.base 0)) (not (= main_~x~10.base 0)) (= 0 (select .cse0 v_prenex_61))))) is different from true [2018-01-28 22:12:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-28 22:12:16,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:12:16,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-01-28 22:12:16,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-28 22:12:16,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-28 22:12:16,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=296, Unknown=8, NotChecked=34, Total=380 [2018-01-28 22:12:16,338 INFO L87 Difference]: Start difference. First operand 596 states and 658 transitions. Second operand 20 states. [2018-01-28 22:12:17,792 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 101 DAG size of output 68 [2018-01-28 22:12:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:18,074 INFO L93 Difference]: Finished difference Result 614 states and 675 transitions. [2018-01-28 22:12:18,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:12:18,075 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-01-28 22:12:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:18,076 INFO L225 Difference]: With dead ends: 614 [2018-01-28 22:12:18,077 INFO L226 Difference]: Without dead ends: 582 [2018-01-28 22:12:18,077 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=175, Invalid=1146, Unknown=15, NotChecked=70, Total=1406 [2018-01-28 22:12:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-01-28 22:12:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 570. [2018-01-28 22:12:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-01-28 22:12:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 631 transitions. [2018-01-28 22:12:18,103 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 631 transitions. Word has length 103 [2018-01-28 22:12:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:18,103 INFO L432 AbstractCegarLoop]: Abstraction has 570 states and 631 transitions. [2018-01-28 22:12:18,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-28 22:12:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 631 transitions. [2018-01-28 22:12:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 22:12:18,103 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:18,104 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:12:18,104 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash -211956307, now seen corresponding path program 1 times [2018-01-28 22:12:18,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:18,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:18,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:18,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:18,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:18,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:18,539 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 25 DAG size of output 16 [2018-01-28 22:12:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:18,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:12:18,949 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:12:18,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:18,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:19,080 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:19,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:19,082 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 22:12:19,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-28 22:12:19,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-28 22:12:19,151 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 22:12:19,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-28 22:12:19,188 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 39 treesize of output 35 [2018-01-28 22:12:19,190 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 14 treesize of output 13 [2018-01-28 22:12:19,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,202 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 22:12:19,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-01-28 22:12:19,279 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 40 treesize of output 33 [2018-01-28 22:12:19,284 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 21 treesize of output 20 [2018-01-28 22:12:19,285 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 22:12:19,294 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 22:12:19,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:19,311 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 2 xjuncts. [2018-01-28 22:12:19,312 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-01-28 22:12:19,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:19,387 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 22:12:19,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:19,392 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 22:12:19,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-28 22:12:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:19,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:12:19,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-01-28 22:12:19,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 22:12:19,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 22:12:19,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-28 22:12:19,465 INFO L87 Difference]: Start difference. First operand 570 states and 631 transitions. Second operand 32 states. [2018-01-28 22:12:20,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:20,931 INFO L93 Difference]: Finished difference Result 687 states and 760 transitions. [2018-01-28 22:12:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 22:12:20,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2018-01-28 22:12:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:20,933 INFO L225 Difference]: With dead ends: 687 [2018-01-28 22:12:20,933 INFO L226 Difference]: Without dead ends: 686 [2018-01-28 22:12:20,934 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2018-01-28 22:12:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-01-28 22:12:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 629. [2018-01-28 22:12:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-01-28 22:12:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 705 transitions. [2018-01-28 22:12:20,964 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 705 transitions. Word has length 105 [2018-01-28 22:12:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:20,964 INFO L432 AbstractCegarLoop]: Abstraction has 629 states and 705 transitions. [2018-01-28 22:12:20,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 22:12:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 705 transitions. [2018-01-28 22:12:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-28 22:12:20,965 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:20,965 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:12:20,965 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash -211956306, now seen corresponding path program 1 times [2018-01-28 22:12:20,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:20,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:20,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:20,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:20,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:20,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:21,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:12:21,584 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:12:21,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:21,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:21,676 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 22:12:21,678 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 22:12:21,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-28 22:12:21,702 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 22:12:21,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,704 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 22:12:21,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-28 22:12:21,734 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 22:12:21,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,739 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:21,739 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 22:12:21,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-28 22:12:21,780 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 22:12:21,782 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,786 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:21,787 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 22:12:21,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-28 22:12:21,833 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 22:12:21,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,840 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,842 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:21,847 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 22:12:21,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-28 22:12:21,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:21,932 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 22:12:21,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:21,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-01-28 22:12:22,008 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 48 treesize of output 49 [2018-01-28 22:12:22,010 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 22:12:22,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-01-28 22:12:22,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-28 22:12:22,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,071 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 22:12:22,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-01-28 22:12:22,152 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 22:12:22,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,156 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,157 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 22:12:22,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:89 [2018-01-28 22:12:22,241 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 73 treesize of output 68 [2018-01-28 22:12:22,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,247 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,247 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 22:12:22,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:98 [2018-01-28 22:12:22,343 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 88 treesize of output 81 [2018-01-28 22:12:22,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,353 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,357 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 22:12:22,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:117, output treesize:98 [2018-01-28 22:12:22,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-28 22:12:22,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:12:22,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,444 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,445 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 82 treesize of output 106 [2018-01-28 22:12:22,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,451 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,452 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 44 treesize of output 89 [2018-01-28 22:12:22,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:131 [2018-01-28 22:12:22,575 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,575 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 231 treesize of output 213 [2018-01-28 22:12:22,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,582 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,583 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 227 [2018-01-28 22:12:22,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 149 [2018-01-28 22:12:22,642 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 22:12:22,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,673 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 22:12:22,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:250, output treesize:200 [2018-01-28 22:12:22,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 139 [2018-01-28 22:12:22,789 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 119 treesize of output 100 [2018-01-28 22:12:22,790 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 22:12:22,816 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 1 [2018-01-28 22:12:22,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:22,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-28 22:12:22,879 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 143 treesize of output 107 [2018-01-28 22:12:22,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:22,927 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:22,938 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 103 treesize of output 117 [2018-01-28 22:12:22,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:23,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,008 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:23,009 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 37 treesize of output 56 [2018-01-28 22:12:23,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:23,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,015 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:23,015 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 50 treesize of output 69 [2018-01-28 22:12:23,015 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:23,043 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:23,046 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 151 treesize of output 115 [2018-01-28 22:12:23,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,060 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:23,064 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 1 case distinctions, treesize of input 103 treesize of output 113 [2018-01-28 22:12:23,064 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:23,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,128 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:23,129 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 50 treesize of output 69 [2018-01-28 22:12:23,129 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:23,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:23,135 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:23,135 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 45 treesize of output 64 [2018-01-28 22:12:23,135 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:23,165 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:23,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-01-28 22:12:23,196 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:221, output treesize:82 [2018-01-28 22:12:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:23,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:12:23,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-01-28 22:12:23,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:12:23,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:12:23,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:12:23,392 INFO L87 Difference]: Start difference. First operand 629 states and 705 transitions. Second operand 33 states. [2018-01-28 22:12:29,379 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 134 DAG size of output 87 [2018-01-28 22:12:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:35,864 INFO L93 Difference]: Finished difference Result 790 states and 871 transitions. [2018-01-28 22:12:35,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-28 22:12:35,865 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2018-01-28 22:12:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:35,868 INFO L225 Difference]: With dead ends: 790 [2018-01-28 22:12:35,868 INFO L226 Difference]: Without dead ends: 789 [2018-01-28 22:12:35,870 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1039, Invalid=5123, Unknown=0, NotChecked=0, Total=6162 [2018-01-28 22:12:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-01-28 22:12:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 650. [2018-01-28 22:12:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-01-28 22:12:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 733 transitions. [2018-01-28 22:12:35,912 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 733 transitions. Word has length 105 [2018-01-28 22:12:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:35,912 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 733 transitions. [2018-01-28 22:12:35,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:12:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 733 transitions. [2018-01-28 22:12:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-28 22:12:35,913 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:35,913 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:12:35,913 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash -788295538, now seen corresponding path program 1 times [2018-01-28 22:12:35,914 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:35,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:35,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:35,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:35,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:35,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-28 22:12:35,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:12:35,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:12:35,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:12:35,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:12:35,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:12:35,976 INFO L87 Difference]: Start difference. First operand 650 states and 733 transitions. Second operand 4 states. [2018-01-28 22:12:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:36,080 INFO L93 Difference]: Finished difference Result 673 states and 760 transitions. [2018-01-28 22:12:36,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:12:36,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-01-28 22:12:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:36,083 INFO L225 Difference]: With dead ends: 673 [2018-01-28 22:12:36,083 INFO L226 Difference]: Without dead ends: 672 [2018-01-28 22:12:36,083 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 22:12:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-01-28 22:12:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 649. [2018-01-28 22:12:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-01-28 22:12:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 732 transitions. [2018-01-28 22:12:36,114 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 732 transitions. Word has length 108 [2018-01-28 22:12:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:36,114 INFO L432 AbstractCegarLoop]: Abstraction has 649 states and 732 transitions. [2018-01-28 22:12:36,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:12:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 732 transitions. [2018-01-28 22:12:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-28 22:12:36,115 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:36,115 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 22:12:36,115 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash -788295537, now seen corresponding path program 1 times [2018-01-28 22:12:36,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:36,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:36,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:36,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:36,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:36,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:36,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:12:36,412 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:12:36,416 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:36,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:36,470 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 22:12:36,471 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 22:12:36,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-28 22:12:36,492 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 22:12:36,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,494 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 22:12:36,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-28 22:12:36,523 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 22:12:36,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,528 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:36,528 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 22:12:36,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-28 22:12:36,570 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 22:12:36,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,576 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:36,576 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 22:12:36,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-28 22:12:36,625 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 22:12:36,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,630 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,634 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:36,639 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 22:12:36,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-28 22:12:36,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 22:12:36,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,741 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 22:12:36,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:54 [2018-01-28 22:12:36,808 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 48 treesize of output 49 [2018-01-28 22:12:36,810 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 22:12:36,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,832 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 22:12:36,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-01-28 22:12:36,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-28 22:12:36,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,883 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 22:12:36,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,913 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 22:12:36,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-01-28 22:12:36,966 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 22:12:36,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:36,971 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:36,971 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 22:12:36,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:36,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,010 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 22:12:37,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:82 [2018-01-28 22:12:37,065 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 73 treesize of output 68 [2018-01-28 22:12:37,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,072 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,072 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 22:12:37,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,113 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 22:12:37,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:91 [2018-01-28 22:12:37,171 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 88 treesize of output 81 [2018-01-28 22:12:37,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,180 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,185 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 22:12:37,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,230 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 22:12:37,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:91 [2018-01-28 22:12:37,251 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 82 treesize of output 75 [2018-01-28 22:12:37,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,262 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,262 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,263 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 22:12:37,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,307 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 22:12:37,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:97 [2018-01-28 22:12:37,367 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 172 treesize of output 165 [2018-01-28 22:12:37,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,374 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,379 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 79 treesize of output 213 [2018-01-28 22:12:37,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-28 22:12:37,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:166 [2018-01-28 22:12:37,572 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 162 treesize of output 122 [2018-01-28 22:12:37,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,578 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,582 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 51 treesize of output 109 [2018-01-28 22:12:37,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:37,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,608 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:37,617 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:37,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 96 [2018-01-28 22:12:37,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:37,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:37,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:12:37,670 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:178, output treesize:25 [2018-01-28 22:12:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:37,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:12:37,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2018-01-28 22:12:37,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-28 22:12:37,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-28 22:12:37,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 22:12:37,858 INFO L87 Difference]: Start difference. First operand 649 states and 732 transitions. Second operand 36 states. [2018-01-28 22:12:38,559 WARN L146 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 41 DAG size of output 36 [2018-01-28 22:12:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:44,680 INFO L93 Difference]: Finished difference Result 925 states and 1026 transitions. [2018-01-28 22:12:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-28 22:12:44,680 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2018-01-28 22:12:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:44,683 INFO L225 Difference]: With dead ends: 925 [2018-01-28 22:12:44,683 INFO L226 Difference]: Without dead ends: 924 [2018-01-28 22:12:44,684 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1762, Invalid=8540, Unknown=0, NotChecked=0, Total=10302 [2018-01-28 22:12:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-01-28 22:12:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 729. [2018-01-28 22:12:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-01-28 22:12:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 830 transitions. [2018-01-28 22:12:44,724 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 830 transitions. Word has length 108 [2018-01-28 22:12:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:44,724 INFO L432 AbstractCegarLoop]: Abstraction has 729 states and 830 transitions. [2018-01-28 22:12:44,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-28 22:12:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 830 transitions. [2018-01-28 22:12:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-28 22:12:44,725 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:44,725 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-28 22:12:44,725 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash 205549903, now seen corresponding path program 1 times [2018-01-28 22:12:44,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:44,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:44,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:44,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:44,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:44,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:45,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:12:45,157 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 22:12:45,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:45,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:12:45,219 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 22:12:45,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-28 22:12:45,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-28 22:12:45,240 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 22:12:45,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,242 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 22:12:45,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-28 22:12:45,270 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 22:12:45,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,274 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,274 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 22:12:45,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-28 22:12:45,311 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 22:12:45,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,317 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,318 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 22:12:45,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-28 22:12:45,364 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 22:12:45,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,374 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,378 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 22:12:45,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-28 22:12:45,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,464 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 22:12:45,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,479 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 22:12:45,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:54 [2018-01-28 22:12:45,544 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 48 treesize of output 49 [2018-01-28 22:12:45,546 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 22:12:45,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,567 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 22:12:45,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-01-28 22:12:45,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-28 22:12:45,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,611 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 22:12:45,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,637 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 22:12:45,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-01-28 22:12:45,682 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 22:12:45,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,686 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,687 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 22:12:45,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,721 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 22:12:45,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:82 [2018-01-28 22:12:45,771 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 73 treesize of output 68 [2018-01-28 22:12:45,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,774 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,777 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,777 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 22:12:45,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,818 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 22:12:45,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:91 [2018-01-28 22:12:45,876 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 88 treesize of output 81 [2018-01-28 22:12:45,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,886 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,890 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 22:12:45,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:45,936 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 22:12:45,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:91 [2018-01-28 22:12:45,962 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 82 treesize of output 75 [2018-01-28 22:12:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,973 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:45,975 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,976 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:45,976 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 22:12:45,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:46,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:46,026 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 22:12:46,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:97 [2018-01-28 22:12:46,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 165 [2018-01-28 22:12:46,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,107 INFO L682 Elim1Store]: detected equality via solver [2018-01-28 22:12:46,113 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 79 treesize of output 213 [2018-01-28 22:12:46,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:12:46,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:12:46,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-28 22:12:46,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:154 [2018-01-28 22:12:46,289 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 150 treesize of output 112 [2018-01-28 22:12:46,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,298 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 120 [2018-01-28 22:12:46,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:12:46,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,324 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:12:46,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 93 [2018-01-28 22:12:46,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 22:12:46,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:12:46,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-28 22:12:46,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:166, output treesize:25 [2018-01-28 22:12:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:12:46,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:12:46,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 34 [2018-01-28 22:12:46,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-28 22:12:46,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-28 22:12:46,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-01-28 22:12:46,534 INFO L87 Difference]: Start difference. First operand 729 states and 830 transitions. Second operand 35 states. [2018-01-28 22:12:47,227 WARN L146 SmtUtils]: Spent 385ms on a formula simplification. DAG size of input: 41 DAG size of output 36 [2018-01-28 22:12:56,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:12:56,999 INFO L93 Difference]: Finished difference Result 911 states and 1012 transitions. [2018-01-28 22:12:57,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-28 22:12:57,000 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 113 [2018-01-28 22:12:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:12:57,002 INFO L225 Difference]: With dead ends: 911 [2018-01-28 22:12:57,002 INFO L226 Difference]: Without dead ends: 910 [2018-01-28 22:12:57,003 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1417, Invalid=6415, Unknown=0, NotChecked=0, Total=7832 [2018-01-28 22:12:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-01-28 22:12:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 753. [2018-01-28 22:12:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-01-28 22:12:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 866 transitions. [2018-01-28 22:12:57,041 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 866 transitions. Word has length 113 [2018-01-28 22:12:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:12:57,041 INFO L432 AbstractCegarLoop]: Abstraction has 753 states and 866 transitions. [2018-01-28 22:12:57,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-28 22:12:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 866 transitions. [2018-01-28 22:12:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-28 22:12:57,042 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:12:57,043 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-28 22:12:57,043 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-28 22:12:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2077081046, now seen corresponding path program 1 times [2018-01-28 22:12:57,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:12:57,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:12:57,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:57,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:12:57,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:12:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:12:57,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:12:57,350 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-28 22:12:57,351 ERROR L119 erpolLogProxyWrapper]: Interpolant 72 not inductive: (Check returned sat) [2018-01-28 22:12:57,352 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-28 22:12:57,356 INFO L168 Benchmark]: Toolchain (without parser) took 85084.02 ms. Allocated memory was 309.9 MB in the beginning and 894.4 MB in the end (delta: 584.6 MB). Free memory was 269.9 MB in the beginning and 451.3 MB in the end (delta: -181.4 MB). Peak memory consumption was 403.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:12:57,358 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 309.9 MB. Free memory is still 275.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:12:57,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.20 ms. Allocated memory is still 309.9 MB. Free memory was 268.9 MB in the beginning and 257.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:12:57,358 INFO L168 Benchmark]: Boogie Preprocessor took 39.81 ms. Allocated memory is still 309.9 MB. Free memory was 257.9 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:12:57,358 INFO L168 Benchmark]: RCFGBuilder took 544.40 ms. Allocated memory is still 309.9 MB. Free memory was 255.8 MB in the beginning and 222.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:12:57,359 INFO L168 Benchmark]: TraceAbstraction took 84263.61 ms. Allocated memory was 309.9 MB in the beginning and 894.4 MB in the end (delta: 584.6 MB). Free memory was 222.2 MB in the beginning and 451.3 MB in the end (delta: -229.1 MB). Peak memory consumption was 355.5 MB. Max. memory is 5.3 GB. [2018-01-28 22:12:57,361 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.25 ms. Allocated memory is still 309.9 MB. Free memory is still 275.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.20 ms. Allocated memory is still 309.9 MB. Free memory was 268.9 MB in the beginning and 257.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.81 ms. Allocated memory is still 309.9 MB. Free memory was 257.9 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 544.40 ms. Allocated memory is still 309.9 MB. Free memory was 255.8 MB in the beginning and 222.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 84263.61 ms. Allocated memory was 309.9 MB in the beginning and 894.4 MB in the end (delta: 584.6 MB). Free memory was 222.2 MB in the beginning and 451.3 MB in the end (delta: -229.1 MB). Peak memory consumption was 355.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-12-57-369.csv Received shutdown request...