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/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:42:14,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:42:14,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:42:14,912 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:42:14,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:42:14,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:42:14,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:42:14,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:42:14,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:42:14,917 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:42:14,918 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:42:14,918 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:42:14,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:42:14,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:42:14,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:42:14,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:42:14,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:42:14,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:42:14,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:42:14,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:42:14,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:42:14,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:42:14,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:42:14,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:42:14,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:42:14,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:42:14,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:42:14,936 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:42:14,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:42:14,936 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:42:14,937 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:42:14,937 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-30 00:42:14,946 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:42:14,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:42:14,947 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:42:14,948 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:42:14,948 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:42:14,948 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:42:14,948 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:42:14,949 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:42:14,949 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:42:14,949 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:42:14,949 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:42:14,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:42:14,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:42:14,950 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:42:14,950 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:42:14,950 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:42:14,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:42:14,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:42:14,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:42:14,951 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:42:14,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:42:14,952 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:42:14,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:42:14,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:42:14,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:42:14,952 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:42:14,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:42:14,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:42:14,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:42:14,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:42:14,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:42:14,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:42:14,954 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:42:14,955 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:42:14,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:42:15,001 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:42:15,005 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:42:15,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:42:15,007 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:42:15,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-01-30 00:42:15,190 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:42:15,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:42:15,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:42:15,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:42:15,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:42:15,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17492289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15, skipping insertion in model container [2018-01-30 00:42:15,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,227 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:42:15,269 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:42:15,405 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:42:15,430 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:42:15,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15 WrapperNode [2018-01-30 00:42:15,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:42:15,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:42:15,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:42:15,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:42:15,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (1/1) ... [2018-01-30 00:42:15,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:42:15,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:42:15,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:42:15,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:42:15,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (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-30 00:42:15,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:42:15,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:42:15,528 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:42:15,528 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 00:42:15,528 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 00:42:15,528 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:42:15,528 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:42:15,528 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:42:15,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:42:16,060 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:42:16,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:42:16 BoogieIcfgContainer [2018-01-30 00:42:16,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:42:16,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:42:16,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:42:16,065 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:42:16,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:42:15" (1/3) ... [2018-01-30 00:42:16,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc2695b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:42:16, skipping insertion in model container [2018-01-30 00:42:16,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:42:15" (2/3) ... [2018-01-30 00:42:16,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc2695b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:42:16, skipping insertion in model container [2018-01-30 00:42:16,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:42:16" (3/3) ... [2018-01-30 00:42:16,068 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-01-30 00:42:16,075 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:42:16,081 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-01-30 00:42:16,122 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:42:16,122 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:42:16,122 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:42:16,122 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:42:16,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:42:16,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:42:16,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:42:16,123 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:42:16,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:42:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-01-30 00:42:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:42:16,147 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:16,148 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:16,148 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1222780229, now seen corresponding path program 1 times [2018-01-30 00:42:16,154 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:16,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:16,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:16,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:16,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:16,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:16,308 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-30 00:42:16,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:16,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:42:16,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:42:16,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:42:16,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:42:16,414 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-01-30 00:42:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:16,664 INFO L93 Difference]: Finished difference Result 265 states and 308 transitions. [2018-01-30 00:42:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:42:16,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:42:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:16,675 INFO L225 Difference]: With dead ends: 265 [2018-01-30 00:42:16,676 INFO L226 Difference]: Without dead ends: 167 [2018-01-30 00:42:16,679 INFO L553 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-30 00:42:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-30 00:42:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 148. [2018-01-30 00:42:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-30 00:42:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-01-30 00:42:16,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 9 [2018-01-30 00:42:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:16,720 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-01-30 00:42:16,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:42:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-01-30 00:42:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:42:16,721 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:16,721 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:16,722 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1222780230, now seen corresponding path program 1 times [2018-01-30 00:42:16,722 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:16,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:16,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:16,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:16,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:16,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:16,817 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-30 00:42:16,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:16,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:42:16,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:42:16,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:42:16,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:42:16,820 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 4 states. [2018-01-30 00:42:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:17,009 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2018-01-30 00:42:17,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:42:17,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:42:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:17,012 INFO L225 Difference]: With dead ends: 172 [2018-01-30 00:42:17,012 INFO L226 Difference]: Without dead ends: 164 [2018-01-30 00:42:17,015 INFO L553 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-30 00:42:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-30 00:42:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-01-30 00:42:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-30 00:42:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2018-01-30 00:42:17,028 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 9 [2018-01-30 00:42:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:17,029 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2018-01-30 00:42:17,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:42:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2018-01-30 00:42:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:42:17,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:17,030 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:17,030 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:17,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1693403223, now seen corresponding path program 1 times [2018-01-30 00:42:17,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:17,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:17,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:17,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:17,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:17,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:17,125 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-30 00:42:17,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:17,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:42:17,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:42:17,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:42:17,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:42:17,126 INFO L87 Difference]: Start difference. First operand 156 states and 163 transitions. Second operand 4 states. [2018-01-30 00:42:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:17,280 INFO L93 Difference]: Finished difference Result 181 states and 189 transitions. [2018-01-30 00:42:17,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:42:17,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-30 00:42:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:17,282 INFO L225 Difference]: With dead ends: 181 [2018-01-30 00:42:17,282 INFO L226 Difference]: Without dead ends: 166 [2018-01-30 00:42:17,283 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-30 00:42:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 148. [2018-01-30 00:42:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-30 00:42:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-01-30 00:42:17,296 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 18 [2018-01-30 00:42:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:17,296 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-01-30 00:42:17,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:42:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-01-30 00:42:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 00:42:17,297 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:17,297 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:17,297 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1693403222, now seen corresponding path program 1 times [2018-01-30 00:42:17,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:17,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:17,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:17,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:17,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:17,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:17,421 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-30 00:42:17,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:17,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:42:17,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:42:17,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:42:17,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:42:17,422 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 7 states. [2018-01-30 00:42:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:17,818 INFO L93 Difference]: Finished difference Result 203 states and 214 transitions. [2018-01-30 00:42:17,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:42:17,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-30 00:42:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:17,820 INFO L225 Difference]: With dead ends: 203 [2018-01-30 00:42:17,820 INFO L226 Difference]: Without dead ends: 195 [2018-01-30 00:42:17,821 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:42:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-30 00:42:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2018-01-30 00:42:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-30 00:42:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2018-01-30 00:42:17,829 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 18 [2018-01-30 00:42:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:17,829 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2018-01-30 00:42:17,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:42:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2018-01-30 00:42:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:42:17,830 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:17,830 INFO L350 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-30 00:42:17,830 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 432107852, now seen corresponding path program 1 times [2018-01-30 00:42:17,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:17,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:17,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:17,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:17,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:17,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:17,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-30 00:42:17,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:17,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:42:17,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:17,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:17,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:17,907 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 5 states. [2018-01-30 00:42:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:18,090 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2018-01-30 00:42:18,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:42:18,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-30 00:42:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:18,092 INFO L225 Difference]: With dead ends: 238 [2018-01-30 00:42:18,092 INFO L226 Difference]: Without dead ends: 237 [2018-01-30 00:42:18,093 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:42:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-30 00:42:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 166. [2018-01-30 00:42:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-30 00:42:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2018-01-30 00:42:18,103 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 20 [2018-01-30 00:42:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:18,104 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2018-01-30 00:42:18,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2018-01-30 00:42:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 00:42:18,105 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:18,105 INFO L350 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-30 00:42:18,105 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 432107853, now seen corresponding path program 1 times [2018-01-30 00:42:18,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:18,106 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:18,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:18,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:18,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:18,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:18,190 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-30 00:42:18,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:18,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:42:18,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:18,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:18,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:18,191 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand 5 states. [2018-01-30 00:42:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:18,384 INFO L93 Difference]: Finished difference Result 265 states and 285 transitions. [2018-01-30 00:42:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:42:18,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-30 00:42:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:18,386 INFO L225 Difference]: With dead ends: 265 [2018-01-30 00:42:18,386 INFO L226 Difference]: Without dead ends: 264 [2018-01-30 00:42:18,386 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:42:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-30 00:42:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 165. [2018-01-30 00:42:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-30 00:42:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 176 transitions. [2018-01-30 00:42:18,396 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 176 transitions. Word has length 20 [2018-01-30 00:42:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:18,396 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 176 transitions. [2018-01-30 00:42:18,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 176 transitions. [2018-01-30 00:42:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:42:18,397 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:18,397 INFO L350 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-30 00:42:18,398 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:18,398 INFO L82 PathProgramCache]: Analyzing trace with hash 745984253, now seen corresponding path program 1 times [2018-01-30 00:42:18,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:18,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:18,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:18,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:18,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:18,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:18,527 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-30 00:42:18,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:18,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:42:18,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:42:18,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:42:18,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:42:18,528 INFO L87 Difference]: Start difference. First operand 165 states and 176 transitions. Second operand 9 states. [2018-01-30 00:42:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:18,876 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-01-30 00:42:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:42:18,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 00:42:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:18,878 INFO L225 Difference]: With dead ends: 182 [2018-01-30 00:42:18,879 INFO L226 Difference]: Without dead ends: 181 [2018-01-30 00:42:18,879 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:42:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-30 00:42:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2018-01-30 00:42:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-30 00:42:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2018-01-30 00:42:18,886 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 25 [2018-01-30 00:42:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:18,887 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2018-01-30 00:42:18,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:42:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2018-01-30 00:42:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:42:18,887 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:18,888 INFO L350 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-30 00:42:18,888 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 745984254, now seen corresponding path program 1 times [2018-01-30 00:42:18,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:18,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:18,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:18,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:18,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:18,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:19,251 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-30 00:42:19,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:19,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 00:42:19,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:42:19,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:42:19,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:42:19,252 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand 10 states. [2018-01-30 00:42:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:19,927 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2018-01-30 00:42:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:42:19,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-01-30 00:42:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:19,928 INFO L225 Difference]: With dead ends: 197 [2018-01-30 00:42:19,929 INFO L226 Difference]: Without dead ends: 188 [2018-01-30 00:42:19,929 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2018-01-30 00:42:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-30 00:42:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2018-01-30 00:42:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:42:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-01-30 00:42:19,936 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 25 [2018-01-30 00:42:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:19,936 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-01-30 00:42:19,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:42:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-01-30 00:42:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:42:19,937 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:19,938 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:19,938 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1339570253, now seen corresponding path program 1 times [2018-01-30 00:42:19,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:19,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:19,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:19,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:19,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:19,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:20,012 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-30 00:42:20,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:20,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:42:20,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:20,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:20,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:20,013 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 5 states. [2018-01-30 00:42:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:20,141 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2018-01-30 00:42:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:42:20,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-30 00:42:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:20,142 INFO L225 Difference]: With dead ends: 223 [2018-01-30 00:42:20,142 INFO L226 Difference]: Without dead ends: 178 [2018-01-30 00:42:20,143 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:42:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-30 00:42:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2018-01-30 00:42:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:42:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2018-01-30 00:42:20,150 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 32 [2018-01-30 00:42:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:20,151 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2018-01-30 00:42:20,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2018-01-30 00:42:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:42:20,152 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:20,152 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:20,152 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash 296358091, now seen corresponding path program 1 times [2018-01-30 00:42:20,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:20,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:20,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:20,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:20,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:20,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:20,227 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-30 00:42:20,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:20,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:42:20,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:20,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:20,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:20,229 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 5 states. [2018-01-30 00:42:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:20,454 INFO L93 Difference]: Finished difference Result 246 states and 262 transitions. [2018-01-30 00:42:20,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:42:20,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-30 00:42:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:20,455 INFO L225 Difference]: With dead ends: 246 [2018-01-30 00:42:20,456 INFO L226 Difference]: Without dead ends: 245 [2018-01-30 00:42:20,456 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:42:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-30 00:42:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 157. [2018-01-30 00:42:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-30 00:42:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-01-30 00:42:20,464 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 33 [2018-01-30 00:42:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:20,464 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-01-30 00:42:20,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-01-30 00:42:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 00:42:20,466 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:20,466 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:20,466 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash 296358092, now seen corresponding path program 1 times [2018-01-30 00:42:20,467 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:20,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:20,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:20,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:20,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:20,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:20,549 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-30 00:42:20,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:20,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:42:20,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:20,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:20,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:20,551 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 5 states. [2018-01-30 00:42:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:20,757 INFO L93 Difference]: Finished difference Result 276 states and 293 transitions. [2018-01-30 00:42:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:42:20,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-30 00:42:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:20,759 INFO L225 Difference]: With dead ends: 276 [2018-01-30 00:42:20,759 INFO L226 Difference]: Without dead ends: 275 [2018-01-30 00:42:20,759 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:42:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-30 00:42:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 156. [2018-01-30 00:42:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-30 00:42:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-01-30 00:42:20,766 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 33 [2018-01-30 00:42:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:20,766 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-01-30 00:42:20,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-01-30 00:42:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:42:20,768 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:20,768 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:20,768 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash -500485274, now seen corresponding path program 1 times [2018-01-30 00:42:20,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:20,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:20,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:20,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:20,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:20,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:20,955 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-30 00:42:20,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:20,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:42:20,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:20,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:20,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:20,956 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 5 states. [2018-01-30 00:42:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:21,107 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-01-30 00:42:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:42:21,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-30 00:42:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:21,108 INFO L225 Difference]: With dead ends: 242 [2018-01-30 00:42:21,108 INFO L226 Difference]: Without dead ends: 165 [2018-01-30 00:42:21,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:42:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-30 00:42:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 154. [2018-01-30 00:42:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-30 00:42:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2018-01-30 00:42:21,114 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 35 [2018-01-30 00:42:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:21,114 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2018-01-30 00:42:21,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2018-01-30 00:42:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:42:21,115 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:21,115 INFO L350 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] [2018-01-30 00:42:21,115 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 313626815, now seen corresponding path program 1 times [2018-01-30 00:42:21,116 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:21,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:21,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:21,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:21,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:21,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:21,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:21,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:42:21,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:42:21,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:42:21,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:42:21,260 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand 8 states. [2018-01-30 00:42:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:21,544 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2018-01-30 00:42:21,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:42:21,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-30 00:42:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:21,545 INFO L225 Difference]: With dead ends: 163 [2018-01-30 00:42:21,545 INFO L226 Difference]: Without dead ends: 162 [2018-01-30 00:42:21,546 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:42:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-30 00:42:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2018-01-30 00:42:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-30 00:42:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-01-30 00:42:21,550 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 38 [2018-01-30 00:42:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:21,550 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-01-30 00:42:21,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:42:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-01-30 00:42:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:42:21,551 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:21,552 INFO L350 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] [2018-01-30 00:42:21,552 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:21,552 INFO L82 PathProgramCache]: Analyzing trace with hash 313626816, now seen corresponding path program 1 times [2018-01-30 00:42:21,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:21,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:21,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:21,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:21,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:21,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:21,726 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-30 00:42:21,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:21,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:42:21,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:42:21,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:42:21,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:42:21,727 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 9 states. [2018-01-30 00:42:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:22,024 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2018-01-30 00:42:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:42:22,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-30 00:42:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:22,025 INFO L225 Difference]: With dead ends: 165 [2018-01-30 00:42:22,025 INFO L226 Difference]: Without dead ends: 160 [2018-01-30 00:42:22,026 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:42:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-30 00:42:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2018-01-30 00:42:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-30 00:42:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-30 00:42:22,031 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 38 [2018-01-30 00:42:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:22,031 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-30 00:42:22,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:42:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-30 00:42:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 00:42:22,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:22,032 INFO L350 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] [2018-01-30 00:42:22,033 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2116697242, now seen corresponding path program 1 times [2018-01-30 00:42:22,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:22,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:22,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:22,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:22,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:22,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:22,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:22,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:42:22,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:42:22,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:42:22,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:42:22,181 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-30 00:42:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:22,313 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-01-30 00:42:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:42:22,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-30 00:42:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:22,314 INFO L225 Difference]: With dead ends: 241 [2018-01-30 00:42:22,314 INFO L226 Difference]: Without dead ends: 144 [2018-01-30 00:42:22,314 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:42:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-30 00:42:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-01-30 00:42:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-30 00:42:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2018-01-30 00:42:22,320 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 42 [2018-01-30 00:42:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:22,320 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2018-01-30 00:42:22,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:42:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2018-01-30 00:42:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:42:22,321 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:22,321 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:22,321 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1075150166, now seen corresponding path program 1 times [2018-01-30 00:42:22,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:22,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:22,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:22,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:22,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:22,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:22,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:22,515 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-30 00:42:22,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:22,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:22,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:22,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:22,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:42:22,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:22,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:22,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-30 00:42:22,709 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-30 00:42:22,712 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-30 00:42:22,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:22,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:22,726 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-30 00:42:22,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-30 00:42:22,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:22,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-01-30 00:42:22,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:22,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:22,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:22,833 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-30 00:42:22,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-01-30 00:42:22,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-01-30 00:42:23,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:23,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:23,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:23,051 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-30 00:42:23,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:84 [2018-01-30 00:42:23,108 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 60 treesize of output 50 [2018-01-30 00:42:23,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:23,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-30 00:42:23,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:23,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:23,123 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-30 00:42:23,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2018-01-30 00:42:23,222 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 36 treesize of output 24 [2018-01-30 00:42:23,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:23,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:23,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-30 00:42:23,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:23,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:23,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:23,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-01-30 00:42:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:23,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:23,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-01-30 00:42:23,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:42:23,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:42:23,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:42:23,351 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 24 states. [2018-01-30 00:42:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:25,065 INFO L93 Difference]: Finished difference Result 270 states and 283 transitions. [2018-01-30 00:42:25,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:42:25,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-01-30 00:42:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:25,066 INFO L225 Difference]: With dead ends: 270 [2018-01-30 00:42:25,066 INFO L226 Difference]: Without dead ends: 269 [2018-01-30 00:42:25,067 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=1219, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:42:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-30 00:42:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 185. [2018-01-30 00:42:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-30 00:42:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-30 00:42:25,078 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 59 [2018-01-30 00:42:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:25,079 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-30 00:42:25,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:42:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-30 00:42:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:42:25,080 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:25,080 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:25,080 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1075150167, now seen corresponding path program 1 times [2018-01-30 00:42:25,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:25,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:25,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:25,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:25,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:25,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:25,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:25,486 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-30 00:42:25,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:25,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:25,581 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-30 00:42:25,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:25,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:25,601 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-30 00:42:25,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-30 00:42:25,627 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-30 00:42:25,630 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-30 00:42:25,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,657 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-30 00:42:25,659 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-30 00:42:25,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-30 00:42:25,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:25,723 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 29 treesize of output 30 [2018-01-30 00:42:25,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:25,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:25,749 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 52 treesize of output 56 [2018-01-30 00:42:25,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:25,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:25,770 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-30 00:42:25,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-01-30 00:42:25,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-01-30 00:42:25,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-01-30 00:42:25,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:25,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:25,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-01-30 00:42:25,986 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 13 [2018-01-30 00:42:25,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-01-30 00:42:26,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:26,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:26,051 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:26,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:26,078 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:123 [2018-01-30 00:42:26,161 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 102 treesize of output 92 [2018-01-30 00:42:26,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:26,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-30 00:42:26,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,192 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 50 treesize of output 45 [2018-01-30 00:42:26,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:26,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-30 00:42:26,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,216 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-30 00:42:26,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2018-01-30 00:42:26,303 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 47 treesize of output 33 [2018-01-30 00:42:26,306 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 28 treesize of output 17 [2018-01-30 00:42:26,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:26,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,323 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 22 treesize of output 20 [2018-01-30 00:42:26,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:26,325 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:42:26,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:26,333 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-01-30 00:42:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:26,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:26,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2018-01-30 00:42:26,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:42:26,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:42:26,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:42:26,397 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 21 states. [2018-01-30 00:42:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:27,408 INFO L93 Difference]: Finished difference Result 272 states and 288 transitions. [2018-01-30 00:42:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:42:27,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-01-30 00:42:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:27,409 INFO L225 Difference]: With dead ends: 272 [2018-01-30 00:42:27,409 INFO L226 Difference]: Without dead ends: 268 [2018-01-30 00:42:27,410 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:42:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-01-30 00:42:27,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 188. [2018-01-30 00:42:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-30 00:42:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2018-01-30 00:42:27,419 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 59 [2018-01-30 00:42:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:27,419 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2018-01-30 00:42:27,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:42:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2018-01-30 00:42:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 00:42:27,420 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:27,420 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:27,421 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash 304636571, now seen corresponding path program 1 times [2018-01-30 00:42:27,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:27,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:27,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:27,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:27,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:27,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:28,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:28,389 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-30 00:42:28,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:28,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:28,625 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-30 00:42:28,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:28,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:28,686 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-30 00:42:28,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-30 00:42:28,750 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-30 00:42:28,752 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-30 00:42:28,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,763 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-30 00:42:28,764 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-30 00:42:28,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-01-30 00:42:28,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:28,830 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 60 treesize of output 64 [2018-01-30 00:42:28,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:28,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:28,854 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 29 treesize of output 30 [2018-01-30 00:42:28,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:28,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:28,870 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-30 00:42:28,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-01-30 00:42:28,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-01-30 00:42:28,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:28,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 77 [2018-01-30 00:42:29,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-01-30 00:42:29,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-01-30 00:42:29,070 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 20 treesize of output 17 [2018-01-30 00:42:29,071 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:29,120 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:135 [2018-01-30 00:42:29,181 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 21 treesize of output 3 [2018-01-30 00:42:29,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,202 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 114 treesize of output 104 [2018-01-30 00:42:29,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:29,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-30 00:42:29,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,235 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 50 treesize of output 45 [2018-01-30 00:42:29,238 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:29,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-30 00:42:29,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,255 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 21 treesize of output 14 [2018-01-30 00:42:29,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:29,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,259 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:29,268 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2018-01-30 00:42:29,397 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 51 treesize of output 37 [2018-01-30 00:42:29,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:29,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-01-30 00:42:29,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,421 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 22 treesize of output 20 [2018-01-30 00:42:29,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:29,423 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-30 00:42:29,428 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:29,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:29,434 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-01-30 00:42:29,502 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-30 00:42:29,508 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:42:29,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:29,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-01-30 00:42:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:29,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:29,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2018-01-30 00:42:29,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-30 00:42:29,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-30 00:42:29,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:42:29,614 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 36 states. [2018-01-30 00:42:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:32,431 INFO L93 Difference]: Finished difference Result 350 states and 369 transitions. [2018-01-30 00:42:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 00:42:32,431 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2018-01-30 00:42:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:32,433 INFO L225 Difference]: With dead ends: 350 [2018-01-30 00:42:32,433 INFO L226 Difference]: Without dead ends: 273 [2018-01-30 00:42:32,435 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=642, Invalid=3647, Unknown=1, NotChecked=0, Total=4290 [2018-01-30 00:42:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-30 00:42:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 184. [2018-01-30 00:42:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-30 00:42:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-01-30 00:42:32,444 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 65 [2018-01-30 00:42:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:32,445 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-01-30 00:42:32,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-30 00:42:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-01-30 00:42:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:42:32,446 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:32,446 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:32,446 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 688418595, now seen corresponding path program 1 times [2018-01-30 00:42:32,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:32,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:32,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:32,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:32,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:32,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:42:32,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:42:32,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:42:32,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:42:32,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:42:32,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:42:32,543 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 6 states. [2018-01-30 00:42:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:32,804 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2018-01-30 00:42:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:42:32,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-01-30 00:42:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:32,805 INFO L225 Difference]: With dead ends: 191 [2018-01-30 00:42:32,806 INFO L226 Difference]: Without dead ends: 146 [2018-01-30 00:42:32,806 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:42:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-30 00:42:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-01-30 00:42:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 00:42:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 143 transitions. [2018-01-30 00:42:32,811 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 143 transitions. Word has length 68 [2018-01-30 00:42:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:32,812 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 143 transitions. [2018-01-30 00:42:32,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:42:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2018-01-30 00:42:32,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:42:32,812 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:32,812 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:32,813 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1959102811, now seen corresponding path program 1 times [2018-01-30 00:42:32,813 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:32,813 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:32,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:32,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:32,814 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:32,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:33,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:33,240 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-30 00:42:33,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:33,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:33,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,289 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-30 00:42:33,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-30 00:42:33,321 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-30 00:42:33,324 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-30 00:42:33,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,350 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-30 00:42:33,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-01-30 00:42:33,373 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 30 treesize of output 26 [2018-01-30 00:42:33,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:33,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,401 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-30 00:42:33,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-30 00:42:33,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-01-30 00:42:33,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:33,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:33,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:33,578 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-30 00:42:33,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-01-30 00:42:33,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,653 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 42 treesize of output 41 [2018-01-30 00:42:33,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,658 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 22 treesize of output 14 [2018-01-30 00:42:33,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-01-30 00:42:33,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:42:33,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-01-30 00:42:33,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-30 00:42:33,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-01-30 00:42:33,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,780 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-30 00:42:33,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-01-30 00:42:33,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:33,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-01-30 00:42:33,833 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-30 00:42:33,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:33,848 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-30 00:42:33,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-01-30 00:42:33,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-01-30 00:42:33,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:33,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:33,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:33,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:33,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:126 [2018-01-30 00:42:34,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 77 [2018-01-30 00:42:34,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:34,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-30 00:42:34,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,077 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-30 00:42:34,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:61 [2018-01-30 00:42:34,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 43 [2018-01-30 00:42:34,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-01-30 00:42:34,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:34,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-30 00:42:34,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:34,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-01-30 00:42:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:34,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:34,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 32 [2018-01-30 00:42:34,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:42:34,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:42:34,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:42:34,229 INFO L87 Difference]: Start difference. First operand 137 states and 143 transitions. Second operand 33 states. [2018-01-30 00:42:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:35,757 INFO L93 Difference]: Finished difference Result 274 states and 282 transitions. [2018-01-30 00:42:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-30 00:42:35,757 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 69 [2018-01-30 00:42:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:35,758 INFO L225 Difference]: With dead ends: 274 [2018-01-30 00:42:35,758 INFO L226 Difference]: Without dead ends: 273 [2018-01-30 00:42:35,759 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=555, Invalid=3477, Unknown=0, NotChecked=0, Total=4032 [2018-01-30 00:42:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-01-30 00:42:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 179. [2018-01-30 00:42:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-30 00:42:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 187 transitions. [2018-01-30 00:42:35,766 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 187 transitions. Word has length 69 [2018-01-30 00:42:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:35,767 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 187 transitions. [2018-01-30 00:42:35,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:42:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 187 transitions. [2018-01-30 00:42:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:42:35,767 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:35,767 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:35,768 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1959102810, now seen corresponding path program 1 times [2018-01-30 00:42:35,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:35,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:35,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:35,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:35,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:35,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:36,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:36,558 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-30 00:42:36,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:36,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:36,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:36,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:36,601 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-30 00:42:36,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-30 00:42: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, 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-30 00:42:36,626 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-30 00:42:36,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,636 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-30 00:42:36,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:42:36,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-01-30 00:42:36,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:36,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-01-30 00:42:36,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:36,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,718 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 29 treesize of output 30 [2018-01-30 00:42:36,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:36,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,731 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-30 00:42:36,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-01-30 00:42:36,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-01-30 00:42:36,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-01-30 00:42:36,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:36,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:36,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-01-30 00:42:36,884 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 13 [2018-01-30 00:42:36,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:36,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-01-30 00:42:36,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:36,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:36,924 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:36,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:36,953 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:131 [2018-01-30 00:42:37,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-01-30 00:42:37,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,089 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 26 treesize of output 37 [2018-01-30 00:42:37,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,130 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 53 treesize of output 52 [2018-01-30 00:42:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,136 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 22 treesize of output 14 [2018-01-30 00:42:37,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2018-01-30 00:42:37,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,208 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 21 [2018-01-30 00:42:37,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:42:37,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-01-30 00:42:37,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-01-30 00:42:37,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-01-30 00:42:37,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-01-30 00:42:37,404 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 18 treesize of output 11 [2018-01-30 00:42:37,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,430 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-30 00:42:37,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-01-30 00:42:37,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-30 00:42:37,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:37,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:37,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-01-30 00:42:37,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, 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-30 00:42:37,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,610 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-30 00:42:37,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-01-30 00:42:37,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 95 [2018-01-30 00:42:37,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:37,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:37,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:37,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 122 [2018-01-30 00:42:37,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-01-30 00:42:37,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:37,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:37,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 114 [2018-01-30 00:42:37,881 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 24 treesize of output 23 [2018-01-30 00:42:37,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,895 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:37,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:37,941 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:142, output treesize:239 [2018-01-30 00:42:38,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-01-30 00:42:38,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:38,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-30 00:42:38,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 99 [2018-01-30 00:42:38,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:38,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-30 00:42:38,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,088 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-30 00:42:38,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:101 [2018-01-30 00:42:38,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-01-30 00:42:38,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:38,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-01-30 00:42:38,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-30 00:42:38,297 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-30 00:42:38,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:38,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-30 00:42:38,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:38,319 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,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 11 treesize of output 3 [2018-01-30 00:42:38,324 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:38,332 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-30 00:42:38,333 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-01-30 00:42:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:38,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:38,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-01-30 00:42:38,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:42:38,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:42:38,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:42:38,457 INFO L87 Difference]: Start difference. First operand 179 states and 187 transitions. Second operand 39 states. [2018-01-30 00:42:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:41,438 INFO L93 Difference]: Finished difference Result 283 states and 295 transitions. [2018-01-30 00:42:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:42:41,439 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 69 [2018-01-30 00:42:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:41,440 INFO L225 Difference]: With dead ends: 283 [2018-01-30 00:42:41,440 INFO L226 Difference]: Without dead ends: 279 [2018-01-30 00:42:41,441 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=548, Invalid=4422, Unknown=0, NotChecked=0, Total=4970 [2018-01-30 00:42:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-01-30 00:42:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 182. [2018-01-30 00:42:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-30 00:42:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 190 transitions. [2018-01-30 00:42:41,450 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 190 transitions. Word has length 69 [2018-01-30 00:42:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:41,451 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 190 transitions. [2018-01-30 00:42:41,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:42:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 190 transitions. [2018-01-30 00:42:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-30 00:42:41,452 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:41,452 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-30 00:42:41,452 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1603766331, now seen corresponding path program 2 times [2018-01-30 00:42:41,453 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:41,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:41,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:41,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:41,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:41,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:41,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:41,793 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-30 00:42:41,800 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:42:41,814 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:42:41,834 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:42:41,838 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:42:41,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:41,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:41,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:41,905 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-30 00:42:41,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-30 00:42:41,959 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-30 00:42:41,961 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-30 00:42:41,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,972 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-30 00:42:41,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-30 00:42:41,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:41,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-01-30 00:42:42,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:42,042 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 51 treesize of output 55 [2018-01-30 00:42:42,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:42,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:42,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-30 00:42:42,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:42,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,079 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-30 00:42:42,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-01-30 00:42:42,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-01-30 00:42:42,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-01-30 00:42:42,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:42,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:42,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2018-01-30 00:42:42,258 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:42,259 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 20 treesize of output 38 [2018-01-30 00:42:42,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,275 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:42,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 78 [2018-01-30 00:42:42,280 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:42,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-30 00:42:42,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:42,324 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:165 [2018-01-30 00:42:42,390 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 117 treesize of output 107 [2018-01-30 00:42:42,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:42,395 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 42 treesize of output 30 [2018-01-30 00:42:42,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,417 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 77 treesize of output 72 [2018-01-30 00:42:42,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:42,421 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 42 treesize of output 30 [2018-01-30 00:42:42,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:42,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2018-01-30 00:42:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:42,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:42,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 32 [2018-01-30 00:42:42,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-30 00:42:42,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-30 00:42:42,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=884, Unknown=5, NotChecked=0, Total=992 [2018-01-30 00:42:42,807 INFO L87 Difference]: Start difference. First operand 182 states and 190 transitions. Second operand 32 states. [2018-01-30 00:42:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:43,947 INFO L93 Difference]: Finished difference Result 239 states and 249 transitions. [2018-01-30 00:42:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 00:42:43,948 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2018-01-30 00:42:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:43,949 INFO L225 Difference]: With dead ends: 239 [2018-01-30 00:42:43,949 INFO L226 Difference]: Without dead ends: 174 [2018-01-30 00:42:43,950 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=2252, Unknown=6, NotChecked=0, Total=2652 [2018-01-30 00:42:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-30 00:42:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-01-30 00:42:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:42:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-01-30 00:42:43,955 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 72 [2018-01-30 00:42:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:43,955 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-01-30 00:42:43,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-30 00:42:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-01-30 00:42:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 00:42:43,955 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:43,955 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:43,956 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1258625878, now seen corresponding path program 1 times [2018-01-30 00:42:43,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:43,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:43,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:43,957 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:42:43,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:43,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:44,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:44,435 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:42:44,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:44,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:44,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:44,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:44,494 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-30 00:42:44,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-30 00:42:44,531 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-30 00:42:44,545 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-30 00:42:44,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,565 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-30 00:42:44,567 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-30 00:42:44,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,579 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-30 00:42:44,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-01-30 00:42:44,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-01-30 00:42:44,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:44,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,636 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 43 treesize of output 39 [2018-01-30 00:42:44,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:44,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,656 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-30 00:42:44,656 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-01-30 00:42:44,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-01-30 00:42:44,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-01-30 00:42:44,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:44,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:44,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-01-30 00:42:44,842 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:44,843 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 17 [2018-01-30 00:42:44,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:44,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-01-30 00:42:44,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-01-30 00:42:44,871 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:44,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:44,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:44,935 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-01-30 00:42:45,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,011 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 61 treesize of output 60 [2018-01-30 00:42:45,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-01-30 00:42:45,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-01-30 00:42:45,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-01-30 00:42:45,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-01-30 00:42:45,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-01-30 00:42:45,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:76 [2018-01-30 00:42:45,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2018-01-30 00:42:45,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-01-30 00:42:45,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-01-30 00:42:45,162 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 18 treesize of output 19 [2018-01-30 00:42:45,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,180 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-30 00:42:45,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:74 [2018-01-30 00:42:45,250 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2018-01-30 00:42:45,259 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-30 00:42:45,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-01-30 00:42:45,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:45,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,308 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-30 00:42:45,308 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:92 [2018-01-30 00:42:45,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 113 [2018-01-30 00:42:45,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:45,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:45,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:45,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 128 [2018-01-30 00:42:45,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:45,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:45,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:45,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 120 [2018-01-30 00:42:45,561 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 20 treesize of output 15 [2018-01-30 00:42:45,561 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,574 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:45,612 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:163, output treesize:213 [2018-01-30 00:42:45,683 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 202 treesize of output 176 [2018-01-30 00:42:45,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,687 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 46 treesize of output 26 [2018-01-30 00:42:45,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 121 [2018-01-30 00:42:45,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:45,723 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 46 treesize of output 26 [2018-01-30 00:42:45,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,742 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-30 00:42:45,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:224, output treesize:114 [2018-01-30 00:42:45,854 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 99 treesize of output 88 [2018-01-30 00:42:45,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:45,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,886 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 70 treesize of output 57 [2018-01-30 00:42:45,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:45,900 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-30 00:42:45,901 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:128, output treesize:86 [2018-01-30 00:42:45,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-01-30 00:42:45,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-01-30 00:42:45,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-01-30 00:42:46,005 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-30 00:42:46,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:46,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:46,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:46,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:46,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2018-01-30 00:42:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:46,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:46,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2018-01-30 00:42:46,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-30 00:42:46,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-30 00:42:46,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1244, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 00:42:46,166 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 38 states. [2018-01-30 00:42:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:48,236 INFO L93 Difference]: Finished difference Result 220 states and 227 transitions. [2018-01-30 00:42:48,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:42:48,236 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2018-01-30 00:42:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:48,237 INFO L225 Difference]: With dead ends: 220 [2018-01-30 00:42:48,237 INFO L226 Difference]: Without dead ends: 219 [2018-01-30 00:42:48,238 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=523, Invalid=3637, Unknown=0, NotChecked=0, Total=4160 [2018-01-30 00:42:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-30 00:42:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 161. [2018-01-30 00:42:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-30 00:42:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2018-01-30 00:42:48,243 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 75 [2018-01-30 00:42:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:48,243 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2018-01-30 00:42:48,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-30 00:42:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2018-01-30 00:42:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 00:42:48,244 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:48,244 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:42:48,244 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1258625877, now seen corresponding path program 1 times [2018-01-30 00:42:48,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:48,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:48,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:48,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:48,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:48,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:48,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:48,817 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:42:48,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:48,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:48,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:48,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:48,860 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-30 00:42:48,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-30 00:42:48,869 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-30 00:42:48,870 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-30 00:42:48,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,880 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-30 00:42:48,881 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-30 00:42:48,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,888 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-30 00:42:48,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-01-30 00:42:48,919 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 51 treesize of output 47 [2018-01-30 00:42:48,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:48,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,933 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 21 treesize of output 14 [2018-01-30 00:42:48,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:48,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:48,943 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-30 00:42:48,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-01-30 00:42:49,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-01-30 00:42:49,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-01-30 00:42:49,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 78 [2018-01-30 00:42:49,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 51 [2018-01-30 00:42:49,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-01-30 00:42:49,130 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:49,131 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 20 treesize of output 21 [2018-01-30 00:42:49,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:49,169 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:159 [2018-01-30 00:42:49,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-01-30 00:42:49,242 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-01-30 00:42:49,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,266 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 61 treesize of output 60 [2018-01-30 00:42:49,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,269 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 26 treesize of output 22 [2018-01-30 00:42:49,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2018-01-30 00:42:49,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:42:49,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:42:49,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-01-30 00:42:49,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:49,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-01-30 00:42:49,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-30 00:42:49,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-01-30 00:42:49,374 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 18 treesize of output 19 [2018-01-30 00:42:49,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-01-30 00:42:49,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,457 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 102 [2018-01-30 00:42:49,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:49,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 106 [2018-01-30 00:42:49,497 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-30 00:42:49,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,519 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-30 00:42:49,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-01-30 00:42:49,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 135 [2018-01-30 00:42:49,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:49,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 131 [2018-01-30 00:42:49,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:49,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:49,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 123 [2018-01-30 00:42:49,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-30 00:42:49,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:49,823 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:164, output treesize:239 [2018-01-30 00:42:49,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 199 [2018-01-30 00:42:49,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-01-30 00:42:49,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 127 [2018-01-30 00:42:49,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:49,940 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 46 treesize of output 26 [2018-01-30 00:42:49,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:49,958 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-30 00:42:49,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2018-01-30 00:42:50,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-01-30 00:42:50,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:50,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:50,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-01-30 00:42:50,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:50,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-01-30 00:42:50,186 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-30 00:42:50,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:50,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-01-30 00:42:50,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:50,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:50,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 00:42:50,218 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:50,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:50,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:50,225 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-01-30 00:42:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:50,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:50,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 36 [2018-01-30 00:42:50,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-30 00:42:50,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-30 00:42:50,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2018-01-30 00:42:50,304 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 37 states. [2018-01-30 00:42:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:51,884 INFO L93 Difference]: Finished difference Result 215 states and 224 transitions. [2018-01-30 00:42:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:42:51,884 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 75 [2018-01-30 00:42:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:51,885 INFO L225 Difference]: With dead ends: 215 [2018-01-30 00:42:51,885 INFO L226 Difference]: Without dead ends: 214 [2018-01-30 00:42:51,886 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=365, Invalid=3417, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 00:42:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-30 00:42:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 161. [2018-01-30 00:42:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-30 00:42:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-01-30 00:42:51,891 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 75 [2018-01-30 00:42:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:51,891 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-01-30 00:42:51,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-30 00:42:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-01-30 00:42:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 00:42:51,892 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:51,892 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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-30 00:42:51,892 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash 87313434, now seen corresponding path program 3 times [2018-01-30 00:42:51,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:51,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:51,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:51,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:42:51,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:51,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:52,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:52,441 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:42:52,446 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:42:52,458 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:42:52,468 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:42:52,535 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:42:52,538 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:42:52,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,557 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-30 00:42:52,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-30 00:42:52,568 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-30 00:42:52,569 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-30 00:42:52,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,577 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-30 00:42:52,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-01-30 00:42:52,593 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 30 treesize of output 26 [2018-01-30 00:42:52,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:52,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,604 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-30 00:42:52,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-01-30 00:42:52,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-30 00:42:52,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:52,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:52,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:52,735 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-30 00:42:52,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:82 [2018-01-30 00:42:52,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,781 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 42 treesize of output 41 [2018-01-30 00:42:52,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,785 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 22 treesize of output 14 [2018-01-30 00:42:52,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-30 00:42:52,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:42:52,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-01-30 00:42:52,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-30 00:42:52,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-01-30 00:42:52,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,856 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-30 00:42:52,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-01-30 00:42:52,914 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:52,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, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-01-30 00:42:52,920 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-30 00:42:52,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:52,934 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-30 00:42:52,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-01-30 00:42:53,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-01-30 00:42:53,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:53,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:53,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:53,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:53,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:132 [2018-01-30 00:42:53,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 77 [2018-01-30 00:42:53,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:53,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-30 00:42:53,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,173 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-30 00:42:53,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:64 [2018-01-30 00:42:53,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-01-30 00:42:53,291 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:53,302 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 27 treesize of output 19 [2018-01-30 00:42:53,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-30 00:42:53,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:53,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:53,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2018-01-30 00:42:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:53,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:53,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 38 [2018-01-30 00:42:53,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:42:53,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:42:53,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:42:53,365 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 39 states. [2018-01-30 00:42:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:42:55,498 INFO L93 Difference]: Finished difference Result 275 states and 285 transitions. [2018-01-30 00:42:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:42:55,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-01-30 00:42:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:42:55,502 INFO L225 Difference]: With dead ends: 275 [2018-01-30 00:42:55,502 INFO L226 Difference]: Without dead ends: 274 [2018-01-30 00:42:55,503 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=830, Invalid=4717, Unknown=3, NotChecked=0, Total=5550 [2018-01-30 00:42:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-30 00:42:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 205. [2018-01-30 00:42:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-01-30 00:42:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 215 transitions. [2018-01-30 00:42:55,513 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 215 transitions. Word has length 76 [2018-01-30 00:42:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:42:55,513 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 215 transitions. [2018-01-30 00:42:55,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:42:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 215 transitions. [2018-01-30 00:42:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 00:42:55,514 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:42:55,514 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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-30 00:42:55,514 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:42:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash 87313435, now seen corresponding path program 2 times [2018-01-30 00:42:55,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:42:55,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:42:55,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:55,515 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:42:55,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:42:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:42:55,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:42:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:56,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:42:56,176 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:42:56,181 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:42:56,192 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:42:56,205 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:42:56,209 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:42:56,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:42:56,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,276 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-30 00:42:56,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-30 00:42:56,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 11 treesize of output 8 [2018-01-30 00:42:56,313 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-30 00:42:56,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,323 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-30 00:42:56,325 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-30 00:42:56,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-01-30 00:42:56,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,393 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 51 treesize of output 55 [2018-01-30 00:42:56,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:56,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,414 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 29 treesize of output 30 [2018-01-30 00:42:56,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:56,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,428 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-30 00:42:56,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:56 [2018-01-30 00:42:56,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2018-01-30 00:42:56,544 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:56,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-01-30 00:42:56,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-01-30 00:42:56,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:42:56,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:56,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:56,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:56,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:137 [2018-01-30 00:42:56,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2018-01-30 00:42:56,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-01-30 00:42:56,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,716 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,719 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 53 treesize of output 52 [2018-01-30 00:42:56,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,723 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 22 treesize of output 14 [2018-01-30 00:42:56,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:64 [2018-01-30 00:42:56,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-01-30 00:42:56,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 00:42:56,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-01-30 00:42:56,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-01-30 00:42:56,869 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 18 treesize of output 11 [2018-01-30 00:42:56,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:56,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-01-30 00:42:56,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-01-30 00:42:56,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:56,915 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-30 00:42:56,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2018-01-30 00:42:56,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-30 00:42:57,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 00:42:57,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:57,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-01-30 00:42:57,035 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-30 00:42:57,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,059 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-30 00:42:57,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:91 [2018-01-30 00:42:57,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2018-01-30 00:42:57,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-01-30 00:42:57,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:57,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:57,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 125 [2018-01-30 00:42:57,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2018-01-30 00:42:57,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:42:57,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:42:57,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 117 [2018-01-30 00:42:57,335 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 20 treesize of output 13 [2018-01-30 00:42:57,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,353 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-30 00:42:57,404 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:145, output treesize:229 [2018-01-30 00:42:57,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 130 [2018-01-30 00:42:57,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:57,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-30 00:42:57,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-01-30 00:42:57,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:42:57,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-01-30 00:42:57,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,552 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-30 00:42:57,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:190, output treesize:104 [2018-01-30 00:42:57,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2018-01-30 00:42:57,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-30 00:42:57,723 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-30 00:42:57,734 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:57,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-01-30 00:42:57,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:57,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:42:57,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-30 00:42:57,765 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:42:57,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-30 00:42:57,766 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:42:57,771 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:42:57,781 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-30 00:42:57,781 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:21 [2018-01-30 00:42:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:42:57,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:42:57,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 44 [2018-01-30 00:42:57,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-30 00:42:57,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-30 00:42:57,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1808, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 00:42:57,913 INFO L87 Difference]: Start difference. First operand 205 states and 215 transitions. Second operand 45 states. [2018-01-30 00:43:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:01,341 INFO L93 Difference]: Finished difference Result 270 states and 282 transitions. [2018-01-30 00:43:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 00:43:01,341 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 76 [2018-01-30 00:43:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:01,342 INFO L225 Difference]: With dead ends: 270 [2018-01-30 00:43:01,342 INFO L226 Difference]: Without dead ends: 266 [2018-01-30 00:43:01,343 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=762, Invalid=5244, Unknown=0, NotChecked=0, Total=6006 [2018-01-30 00:43:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-30 00:43:01,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2018-01-30 00:43:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-30 00:43:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 218 transitions. [2018-01-30 00:43:01,351 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 218 transitions. Word has length 76 [2018-01-30 00:43:01,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:01,351 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 218 transitions. [2018-01-30 00:43:01,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-30 00:43:01,351 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 218 transitions. [2018-01-30 00:43:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-30 00:43:01,351 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:01,352 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:01,352 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr58EnsuresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1048433388, now seen corresponding path program 1 times [2018-01-30 00:43:01,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:01,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:01,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:01,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:43:01,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:43:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:43:01,428 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:43:01,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:43:01 BoogieIcfgContainer [2018-01-30 00:43:01,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:43:01,491 INFO L168 Benchmark]: Toolchain (without parser) took 46300.76 ms. Allocated memory was 304.1 MB in the beginning and 793.2 MB in the end (delta: 489.2 MB). Free memory was 262.0 MB in the beginning and 632.8 MB in the end (delta: -370.8 MB). Peak memory consumption was 118.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:01,492 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 304.1 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:43:01,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.89 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 248.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:01,493 INFO L168 Benchmark]: Boogie Preprocessor took 37.87 ms. Allocated memory is still 304.1 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:01,493 INFO L168 Benchmark]: RCFGBuilder took 584.84 ms. Allocated memory is still 304.1 MB. Free memory was 246.7 MB in the beginning and 208.7 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:01,494 INFO L168 Benchmark]: TraceAbstraction took 45428.37 ms. Allocated memory was 304.1 MB in the beginning and 793.2 MB in the end (delta: 489.2 MB). Free memory was 208.7 MB in the beginning and 632.8 MB in the end (delta: -424.1 MB). Peak memory consumption was 65.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:01,495 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.24 ms. Allocated memory is still 304.1 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.89 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 248.7 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.87 ms. Allocated memory is still 304.1 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 584.84 ms. Allocated memory is still 304.1 MB. Free memory was 246.7 MB in the beginning and 208.7 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45428.37 ms. Allocated memory was 304.1 MB in the beginning and 793.2 MB in the end (delta: 489.2 MB). Free memory was 208.7 MB in the beginning and 632.8 MB in the end (delta: -424.1 MB). Peak memory consumption was 65.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={24:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={24:0}, malloc(sizeof(SLL))={24:0}] [L995] FCALL list->next = ((void*)0) VAL [list={24:0}, malloc(sizeof(SLL))={24:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={24:0}, malloc(sizeof(SLL))={24:0}] [L997] FCALL list->colour = BLACK VAL [list={24:0}, malloc(sizeof(SLL))={24:0}] [L999] SLL* end = list; VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={24:0}] [L1002] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, end={24:0}, list={24:0}, malloc(sizeof(SLL))={24:0}] [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1006] EXPR, FCALL end->next VAL [end={24:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1006] FCALL end->next->prev = end VAL [end={24:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1007] EXPR, FCALL end->next VAL [end={24:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1007] end = end->next VAL [end={22:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1008] FCALL end->next = ((void*)0) VAL [end={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1016] FCALL end->colour = RED VAL [end={22:0}, list={24:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1018] EXPR, FCALL end->next VAL [end={22:0}, end->next={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1018] FCALL end->next->prev = end VAL [end={22:0}, end->next={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1019] EXPR, FCALL end->next VAL [end={22:0}, end->next={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1019] end = end->next VAL [end={15:0}, end->next={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1025] end = ((void*)0) VAL [end={0:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1026] end = list VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1029] COND FALSE !(0) VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1030] EXPR, FCALL end->colour VAL [end={24:0}, end->colour=1, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) VAL [end={24:0}, end->colour=1, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1030] COND FALSE !(0) VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1034] EXPR, FCALL end->colour VAL [end={24:0}, end->colour=1, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1034] COND FALSE !(RED == end->colour) VAL [end={24:0}, end->colour=1, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1040] EXPR, FCALL end->next VAL [end={24:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1040] COND FALSE !(!(end->next)) VAL [end={24:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1040] COND FALSE !(0) VAL [end={24:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1041] EXPR, FCALL end->next VAL [end={24:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1041] end = end->next VAL [end={22:0}, end->next={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={22:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1034] EXPR, FCALL end->colour VAL [end={22:0}, end->colour=0, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1034] COND TRUE RED == end->colour VAL [end={22:0}, end->colour=0, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1036] EXPR, FCALL end->next VAL [end={22:0}, end->next={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1036] end = end->next VAL [end={15:0}, end->next={15:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1037] end = end->next VAL [end={0:0}, end->next={0:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] [L1040] FCALL end->next VAL [end={0:0}, list={24:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={24:0}, malloc(sizeof(SLL))={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 59 error locations. UNSAFE Result, 45.3s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2525 SDtfs, 9258 SDslu, 16953 SDs, 0 SdLazy, 18217 SolverSat, 1280 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1325 GetRequests, 554 SyntacticMatches, 59 SemanticMatches, 712 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9462 ImplicationChecksByTransitivity, 21.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1269 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1932 NumberOfCodeBlocks, 1932 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1817 ConstructedInterpolants, 364 QuantifiedInterpolants, 3427085 SizeOfPredicates, 228 NumberOfNonLiveVariables, 2455 ConjunctsInSsa, 537 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 30/246 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-43-01-502.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-43-01-502.csv Received shutdown request...