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/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:33:41,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:33:41,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:33:41,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:33:41,969 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:33:41,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:33:41,971 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:33:41,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:33:41,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:33:41,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:33:41,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:33:41,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:33:41,978 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:33:41,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:33:41,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:33:41,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:33:41,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:33:41,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:33:41,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:33:41,989 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:33:41,991 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:33:41,991 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:33:41,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:33:41,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:33:41,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:33:41,995 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:33:41,995 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:33:41,996 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:33:41,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:33:41,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:33:41,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:33:41,997 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-29 22:33:42,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:33:42,007 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:33:42,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:33:42,007 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:33:42,007 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:33:42,008 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:33:42,008 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:33:42,008 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:33:42,008 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:33:42,008 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:33:42,009 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:33:42,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:33:42,010 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:33:42,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:33:42,010 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:33:42,010 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:33:42,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:33:42,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:33:42,011 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:33:42,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:33:42,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:33:42,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:33:42,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:33:42,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:33:42,012 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:33:42,012 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:33:42,013 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:33:42,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:33:42,055 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:33:42,059 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:33:42,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:33:42,061 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:33:42,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:33:42,215 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:33:42,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:33:42,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:33:42,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:33:42,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:33:42,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6f32fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42, skipping insertion in model container [2018-01-29 22:33:42,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,245 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:33:42,283 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:33:42,399 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:33:42,416 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:33:42,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42 WrapperNode [2018-01-29 22:33:42,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:33:42,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:33:42,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:33:42,424 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:33:42,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (1/1) ... [2018-01-29 22:33:42,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:33:42,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:33:42,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:33:42,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:33:42,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (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-29 22:33:42,514 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:33:42,514 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:33:42,514 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:33:42,514 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:33:42,514 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:33:42,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:33:42,515 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:33:42,515 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:33:42,515 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:33:42,515 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:33:42,515 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:33:42,515 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:33:42,713 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:33:42,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:33:42 BoogieIcfgContainer [2018-01-29 22:33:42,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:33:42,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:33:42,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:33:42,717 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:33:42,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:33:42" (1/3) ... [2018-01-29 22:33:42,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d754958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:33:42, skipping insertion in model container [2018-01-29 22:33:42,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:33:42" (2/3) ... [2018-01-29 22:33:42,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d754958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:33:42, skipping insertion in model container [2018-01-29 22:33:42,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:33:42" (3/3) ... [2018-01-29 22:33:42,720 INFO L107 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:33:42,726 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:33:42,733 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-29 22:33:42,783 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:33:42,784 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:33:42,784 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:33:42,784 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:33:42,784 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:33:42,784 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:33:42,784 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:33:42,785 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:33:42,785 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:33:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-29 22:33:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 22:33:42,813 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:42,814 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-29 22:33:42,814 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1917879530, now seen corresponding path program 1 times [2018-01-29 22:33:42,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:42,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:42,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:42,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:42,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:42,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:43,027 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-29 22:33:43,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:33:43,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:33:43,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:33:43,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:33:43,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:33:43,051 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-01-29 22:33:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:43,317 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-29 22:33:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:33:43,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-29 22:33:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:43,326 INFO L225 Difference]: With dead ends: 66 [2018-01-29 22:33:43,326 INFO L226 Difference]: Without dead ends: 50 [2018-01-29 22:33:43,329 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-29 22:33:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-29 22:33:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-29 22:33:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-29 22:33:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-29 22:33:43,359 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 18 [2018-01-29 22:33:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:43,359 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-29 22:33:43,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:33:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-29 22:33:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 22:33:43,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:43,360 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-29 22:33:43,360 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1917879531, now seen corresponding path program 1 times [2018-01-29 22:33:43,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:43,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:43,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:43,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:43,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:43,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:43,483 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-29 22:33:43,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:33:43,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:33:43,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:33:43,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:33:43,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:33:43,487 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-29 22:33:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:43,711 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-01-29 22:33:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:33:43,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-29 22:33:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:43,713 INFO L225 Difference]: With dead ends: 72 [2018-01-29 22:33:43,714 INFO L226 Difference]: Without dead ends: 69 [2018-01-29 22:33:43,715 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:33:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-29 22:33:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-01-29 22:33:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-29 22:33:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-29 22:33:43,724 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2018-01-29 22:33:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:43,724 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-29 22:33:43,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:33:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-29 22:33:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:33:43,725 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:43,725 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:43,725 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash -679096899, now seen corresponding path program 1 times [2018-01-29 22:33:43,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:43,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:43,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:43,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:43,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:43,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:43,777 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-29 22:33:43,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:33:43,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:33:43,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:33:43,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:33:43,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:33:43,779 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 4 states. [2018-01-29 22:33:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:43,822 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-29 22:33:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:33:43,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:33:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:43,823 INFO L225 Difference]: With dead ends: 58 [2018-01-29 22:33:43,823 INFO L226 Difference]: Without dead ends: 53 [2018-01-29 22:33:43,823 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:33:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-29 22:33:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-29 22:33:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-29 22:33:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-01-29 22:33:43,829 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2018-01-29 22:33:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:43,829 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-01-29 22:33:43,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:33:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-01-29 22:33:43,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:33:43,829 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:43,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] [2018-01-29 22:33:43,830 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:43,830 INFO L82 PathProgramCache]: Analyzing trace with hash -675276707, now seen corresponding path program 1 times [2018-01-29 22:33:43,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:43,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:43,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:43,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:43,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:43,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:43,989 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-29 22:33:43,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:33:43,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:33:43,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:33:43,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:33:43,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:33:43,991 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-01-29 22:33:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:44,107 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-01-29 22:33:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:33:44,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-29 22:33:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:44,109 INFO L225 Difference]: With dead ends: 64 [2018-01-29 22:33:44,109 INFO L226 Difference]: Without dead ends: 62 [2018-01-29 22:33:44,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:33:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-29 22:33:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2018-01-29 22:33:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-29 22:33:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-29 22:33:44,117 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 19 [2018-01-29 22:33:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:44,118 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-29 22:33:44,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:33:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-29 22:33:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:33:44,119 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:44,120 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] [2018-01-29 22:33:44,120 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1131978318, now seen corresponding path program 1 times [2018-01-29 22:33:44,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:44,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:44,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:44,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:44,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:44,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:44,214 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-29 22:33:44,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:33:44,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:33:44,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:33:44,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:33:44,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:33:44,216 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 4 states. [2018-01-29 22:33:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:44,259 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-29 22:33:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:33:44,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-29 22:33:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:44,260 INFO L225 Difference]: With dead ends: 51 [2018-01-29 22:33:44,260 INFO L226 Difference]: Without dead ends: 44 [2018-01-29 22:33:44,260 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:33:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-29 22:33:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-29 22:33:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-29 22:33:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-29 22:33:44,264 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 26 [2018-01-29 22:33:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:44,265 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-29 22:33:44,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:33:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-29 22:33:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:33:44,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:44,266 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:44,266 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash -395515362, now seen corresponding path program 1 times [2018-01-29 22:33:44,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:44,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:44,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:44,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:44,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:44,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:44,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:44,333 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-29 22:33:44,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:44,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:44,422 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:44,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-29 22:33:44,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:33:44,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:33:44,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:33:44,424 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 6 states. [2018-01-29 22:33:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:44,484 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-29 22:33:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:33:44,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-29 22:33:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:44,485 INFO L225 Difference]: With dead ends: 48 [2018-01-29 22:33:44,485 INFO L226 Difference]: Without dead ends: 47 [2018-01-29 22:33:44,486 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:33:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-29 22:33:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-01-29 22:33:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-29 22:33:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-01-29 22:33:44,492 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 32 [2018-01-29 22:33:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:44,492 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-01-29 22:33:44,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:33:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-01-29 22:33:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:33:44,494 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:44,494 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:44,494 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash -395515361, now seen corresponding path program 1 times [2018-01-29 22:33:44,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:44,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:44,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:44,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:44,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:44,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:45,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:45,023 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-29 22:33:45,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:45,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:45,074 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-29 22:33:45,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:45,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:45,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-29 22:33:45,135 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-29 22:33:45,143 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-29 22:33:45,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:33:45,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:33:45,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:33:45,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-29 22:33:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:45,321 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:45,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-01-29 22:33:45,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 22:33:45,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 22:33:45,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-01-29 22:33:45,323 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 18 states. [2018-01-29 22:33:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:45,763 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-01-29 22:33:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 22:33:45,763 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-01-29 22:33:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:45,764 INFO L225 Difference]: With dead ends: 64 [2018-01-29 22:33:45,764 INFO L226 Difference]: Without dead ends: 61 [2018-01-29 22:33:45,765 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2018-01-29 22:33:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-29 22:33:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-01-29 22:33:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-29 22:33:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-29 22:33:45,772 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 32 [2018-01-29 22:33:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:45,772 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-29 22:33:45,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 22:33:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-29 22:33:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 22:33:45,774 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:45,774 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 22:33:45,774 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1325802579, now seen corresponding path program 2 times [2018-01-29 22:33:45,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:45,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:45,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:45,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:33:45,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:45,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:46,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:46,214 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-29 22:33:46,222 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:33:46,233 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:46,239 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:46,241 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:33:46,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:46,247 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-29 22:33:46,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:46,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:46,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:33:46,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:46,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:46,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:46,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:46,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:46,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:33:46,341 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-29 22:33:46,348 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-29 22:33:46,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:33:46,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:33:46,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:33:46,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:33:46,602 WARN L143 SmtUtils]: Spent 223ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-29 22:33:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:46,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:46,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-01-29 22:33:46,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 22:33:46,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 22:33:46,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-01-29 22:33:46,730 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-01-29 22:33:47,512 WARN L143 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-29 22:33:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:47,616 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-01-29 22:33:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 22:33:47,616 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-01-29 22:33:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:47,617 INFO L225 Difference]: With dead ends: 78 [2018-01-29 22:33:47,617 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 22:33:47,618 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:33:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 22:33:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-01-29 22:33:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-29 22:33:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-01-29 22:33:47,627 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 46 [2018-01-29 22:33:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:47,627 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-01-29 22:33:47,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 22:33:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-01-29 22:33:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 22:33:47,629 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:47,629 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:47,629 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1400671353, now seen corresponding path program 3 times [2018-01-29 22:33:47,630 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:47,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:47,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:47,631 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:33:47,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:47,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:48,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:48,197 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-29 22:33:48,202 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:33:48,214 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:33:48,219 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:33:48,224 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:33:48,229 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:33:48,231 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:33:48,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:48,239 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-29 22:33:48,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:33:48,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:48,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:48,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:33:48,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:48,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:48,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:33:48,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-29 22:33:48,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-29 22:33:48,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:48,510 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-29 22:33:48,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-29 22:33:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:48,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:48,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-01-29 22:33:48,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 22:33:48,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 22:33:48,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-01-29 22:33:48,619 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 24 states. [2018-01-29 22:33:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:49,411 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-01-29 22:33:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:33:49,415 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 60 [2018-01-29 22:33:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:49,416 INFO L225 Difference]: With dead ends: 92 [2018-01-29 22:33:49,416 INFO L226 Difference]: Without dead ends: 89 [2018-01-29 22:33:49,417 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 22:33:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-29 22:33:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-01-29 22:33:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:33:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-01-29 22:33:49,424 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 60 [2018-01-29 22:33:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:49,425 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-01-29 22:33:49,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 22:33:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-01-29 22:33:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-29 22:33:49,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:49,426 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:49,427 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 563877819, now seen corresponding path program 4 times [2018-01-29 22:33:49,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:49,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:49,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:49,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:33:49,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:49,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:50,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:50,299 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-29 22:33:50,304 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:33:50,332 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:33:50,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:50,343 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-29 22:33:50,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:50,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:50,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:33:50,588 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-29 22:33:50,593 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-29 22:33:50,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:33:50,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:33:50,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:33:50,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:33:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:50,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:50,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-01-29 22:33:50,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:33:50,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:33:50,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:33:50,786 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 29 states. [2018-01-29 22:33:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:51,812 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-01-29 22:33:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 22:33:51,812 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-01-29 22:33:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:51,814 INFO L225 Difference]: With dead ends: 106 [2018-01-29 22:33:51,814 INFO L226 Difference]: Without dead ends: 103 [2018-01-29 22:33:51,815 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:33:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-29 22:33:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-01-29 22:33:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 22:33:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-01-29 22:33:51,823 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 74 [2018-01-29 22:33:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:51,824 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-01-29 22:33:51,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:33:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-01-29 22:33:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-29 22:33:51,825 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:51,825 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:51,825 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1655222033, now seen corresponding path program 5 times [2018-01-29 22:33:51,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:51,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:51,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:51,827 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:33:51,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:51,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:52,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:52,555 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-29 22:33:52,560 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 22:33:52,573 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:52,577 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:52,582 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:52,586 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:52,595 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:52,601 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:33:52,605 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:33:52,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:52,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:33:52,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:33:52,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:52,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:52,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:33:52,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:52,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:52,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:33:52,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:52,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:52,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:33:52,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:52,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:33:52,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:52,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-29 22:33:52,982 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-29 22:33:52,988 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-29 22:33:52,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:33:52,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:33:52,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:33:52,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:33:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:53,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:53,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-29 22:33:53,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 22:33:53,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 22:33:53,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 22:33:53,195 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 34 states. [2018-01-29 22:33:54,590 WARN L143 SmtUtils]: Spent 271ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-29 22:33:54,881 WARN L143 SmtUtils]: Spent 237ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-29 22:33:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:33:55,007 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-01-29 22:33:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 22:33:55,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 88 [2018-01-29 22:33:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:33:55,008 INFO L225 Difference]: With dead ends: 120 [2018-01-29 22:33:55,008 INFO L226 Difference]: Without dead ends: 117 [2018-01-29 22:33:55,009 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=353, Invalid=2953, Unknown=0, NotChecked=0, Total=3306 [2018-01-29 22:33:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-29 22:33:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-29 22:33:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 22:33:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-01-29 22:33:55,015 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 88 [2018-01-29 22:33:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:33:55,015 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-01-29 22:33:55,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 22:33:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-01-29 22:33:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-29 22:33:55,016 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:33:55,016 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:33:55,016 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:33:55,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1861460189, now seen corresponding path program 6 times [2018-01-29 22:33:55,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:33:55,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:33:55,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:55,018 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:33:55,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:33:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:33:55,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:33:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:55,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:33:55,883 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-29 22:33:55,888 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 22:33:55,898 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,901 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,905 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,910 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,915 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,920 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,930 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:33:55,933 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:33:55,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:33:55,948 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-29 22:33:55,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:55,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:55,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:33:56,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:56,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:56,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:33:56,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:56,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:56,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-29 22:33:56,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:56,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:33:56,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-29 22:33:56,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:33:56,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:33:56,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:26 [2018-01-29 22:33:56,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-29 22:33:56,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-01-29 22:33:56,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:33:56,499 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-29 22:33:56,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-29 22:33:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:33:56,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:33:56,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-29 22:33:56,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:33:56,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:33:56,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1303, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:33:56,665 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 39 states. [2018-01-29 22:33:59,504 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 78 DAG size of output 64 [2018-01-29 22:34:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:01,007 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-01-29 22:34:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-29 22:34:01,007 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-01-29 22:34:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:01,008 INFO L225 Difference]: With dead ends: 190 [2018-01-29 22:34:01,008 INFO L226 Difference]: Without dead ends: 187 [2018-01-29 22:34:01,010 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1667, Invalid=8839, Unknown=0, NotChecked=0, Total=10506 [2018-01-29 22:34:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-29 22:34:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-01-29 22:34:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-29 22:34:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-01-29 22:34:01,022 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 102 [2018-01-29 22:34:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:01,022 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-01-29 22:34:01,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:34:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-01-29 22:34:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-29 22:34:01,025 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:01,025 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:34:01,025 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:34:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash 335995175, now seen corresponding path program 7 times [2018-01-29 22:34:01,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:01,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:01,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:01,027 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:01,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:01,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:02,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:02,851 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-29 22:34:02,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:02,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:02,914 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-29 22:34:02,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:02,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:02,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:34:02,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:02,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:02,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:34:03,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:03,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:03,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,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 10 treesize of output 11 [2018-01-29 22:34:03,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:03,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:03,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:03,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:03,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,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 10 treesize of output 11 [2018-01-29 22:34:03,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:03,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:03,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:03,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:03,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:04,029 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-29 22:34:04,037 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-29 22:34:04,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:04,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:04,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:34:04,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:34:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:04,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:04,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-01-29 22:34:04,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-29 22:34:04,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-29 22:34:04,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3131, Unknown=0, NotChecked=0, Total=3306 [2018-01-29 22:34:04,433 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 58 states. [2018-01-29 22:34:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:07,761 INFO L93 Difference]: Finished difference Result 204 states and 205 transitions. [2018-01-29 22:34:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-29 22:34:07,762 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 172 [2018-01-29 22:34:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:07,763 INFO L225 Difference]: With dead ends: 204 [2018-01-29 22:34:07,763 INFO L226 Difference]: Without dead ends: 201 [2018-01-29 22:34:07,765 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 144 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2611 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=620, Invalid=9886, Unknown=0, NotChecked=0, Total=10506 [2018-01-29 22:34:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-29 22:34:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-01-29 22:34:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-29 22:34:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-01-29 22:34:07,776 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 172 [2018-01-29 22:34:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:07,777 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-01-29 22:34:07,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-29 22:34:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-01-29 22:34:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-01-29 22:34:07,779 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:07,779 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:34:07,779 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:34:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1027550555, now seen corresponding path program 8 times [2018-01-29 22:34:07,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:07,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:07,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:07,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:34:07,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:07,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:09,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:09,537 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-29 22:34:09,542 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:34:09,557 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:09,593 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:34:09,604 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:09,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:09,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, 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-29 22:34:09,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:34:09,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:09,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:09,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:34:09,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:09,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:09,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:09,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:09,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:09,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:09,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:09,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:09,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:09,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:09,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:09,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:09,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:10,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:34:10,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:10,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:10,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:10,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:10,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:10,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 10 treesize of output 11 [2018-01-29 22:34:10,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:10,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:10,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:10,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:10,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:10,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:10,638 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-29 22:34:10,645 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-29 22:34:10,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:10,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:10,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:34:10,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:34:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 948 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:11,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:11,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2018-01-29 22:34:11,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-01-29 22:34:11,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-01-29 22:34:11,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3332, Unknown=0, NotChecked=0, Total=3782 [2018-01-29 22:34:11,017 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 62 states. [2018-01-29 22:34:16,901 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 143 DAG size of output 83 [2018-01-29 22:34:17,249 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 141 DAG size of output 116 [2018-01-29 22:34:17,414 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-29 22:34:17,569 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-01-29 22:34:17,733 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-01-29 22:34:18,143 WARN L146 SmtUtils]: Spent 212ms on a formula simplification. DAG size of input: 127 DAG size of output 107 [2018-01-29 22:34:18,443 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 130 DAG size of output 107 [2018-01-29 22:34:18,901 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-29 22:34:19,291 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 116 DAG size of output 98 [2018-01-29 22:34:19,563 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 119 DAG size of output 98 [2018-01-29 22:34:20,337 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 105 DAG size of output 89 [2018-01-29 22:34:20,585 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-01-29 22:34:21,298 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-29 22:34:21,521 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-29 22:34:22,166 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-29 22:34:22,376 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-01-29 22:34:23,146 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-01-29 22:34:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:34:24,947 INFO L93 Difference]: Finished difference Result 358 states and 389 transitions. [2018-01-29 22:34:24,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-01-29 22:34:24,948 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 186 [2018-01-29 22:34:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:34:24,949 INFO L225 Difference]: With dead ends: 358 [2018-01-29 22:34:24,950 INFO L226 Difference]: Without dead ends: 355 [2018-01-29 22:34:24,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 157 SyntacticMatches, 4 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13557 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=6022, Invalid=31420, Unknown=0, NotChecked=0, Total=37442 [2018-01-29 22:34:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-29 22:34:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 351. [2018-01-29 22:34:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-01-29 22:34:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-01-29 22:34:24,971 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 186 [2018-01-29 22:34:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:34:24,971 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-01-29 22:34:24,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-01-29 22:34:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-01-29 22:34:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-01-29 22:34:24,977 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:34:24,977 INFO L350 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:34:24,978 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:34:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1615602281, now seen corresponding path program 9 times [2018-01-29 22:34:24,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:34:24,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:34:24,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:24,979 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:34:24,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:34:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:34:25,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:34:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3588 backedges. 0 proven. 3588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:29,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:34:29,125 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-29 22:34:29,130 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:34:29,151 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,155 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,158 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,162 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,167 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,173 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,179 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,186 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,195 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,203 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,219 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,254 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,264 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,302 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,446 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,628 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,714 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,836 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,864 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,905 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,954 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:29,979 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:30,037 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:30,074 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:34:30,090 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:34:30,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:34:30,106 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-29 22:34:30,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:30,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:30,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:34:32,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:34:32,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:34:32,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:34:32,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:32,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:34:32,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:34:32,515 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-29 22:34:32,520 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-29 22:34:32,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:34:32,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:34:32,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:34:32,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:34:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3588 backedges. 0 proven. 3588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:34:33,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:34:33,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 53] total 105 [2018-01-29 22:34:33,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-01-29 22:34:33,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-01-29 22:34:33,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=9800, Unknown=0, NotChecked=0, Total=11130 [2018-01-29 22:34:33,165 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 106 states. [2018-01-29 22:34:46,518 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 284 DAG size of output 43 [2018-01-29 22:34:47,499 WARN L146 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 264 DAG size of output 138 [2018-01-29 22:34:48,317 WARN L146 SmtUtils]: Spent 571ms on a formula simplification. DAG size of input: 262 DAG size of output 215 [2018-01-29 22:34:48,685 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 152 DAG size of output 125 [2018-01-29 22:34:49,035 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 154 DAG size of output 131 [2018-01-29 22:34:49,381 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 158 DAG size of output 135 [2018-01-29 22:34:49,688 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 144 DAG size of output 121 [2018-01-29 22:34:50,351 WARN L146 SmtUtils]: Spent 522ms on a formula simplification. DAG size of input: 248 DAG size of output 206 [2018-01-29 22:34:51,091 WARN L146 SmtUtils]: Spent 508ms on a formula simplification. DAG size of input: 251 DAG size of output 206 [2018-01-29 22:34:51,439 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 146 DAG size of output 120 [2018-01-29 22:34:51,767 WARN L146 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 148 DAG size of output 126 [2018-01-29 22:34:52,095 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 152 DAG size of output 130 [2018-01-29 22:34:52,389 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 138 DAG size of output 116 [2018-01-29 22:34:53,018 WARN L146 SmtUtils]: Spent 486ms on a formula simplification. DAG size of input: 237 DAG size of output 197 [2018-01-29 22:34:53,733 WARN L146 SmtUtils]: Spent 479ms on a formula simplification. DAG size of input: 240 DAG size of output 197 [2018-01-29 22:34:54,071 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 140 DAG size of output 115 [2018-01-29 22:34:54,373 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 142 DAG size of output 121 [2018-01-29 22:34:54,701 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 146 DAG size of output 125 [2018-01-29 22:34:54,978 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 132 DAG size of output 111 [2018-01-29 22:34:55,560 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 226 DAG size of output 188 [2018-01-29 22:34:56,247 WARN L146 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 229 DAG size of output 188 [2018-01-29 22:34:56,573 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 134 DAG size of output 110 [2018-01-29 22:34:56,868 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 136 DAG size of output 116 [2018-01-29 22:34:57,172 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 140 DAG size of output 120 [2018-01-29 22:34:57,447 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 126 DAG size of output 106 [2018-01-29 22:34:58,020 WARN L146 SmtUtils]: Spent 427ms on a formula simplification. DAG size of input: 215 DAG size of output 179 [2018-01-29 22:34:58,667 WARN L146 SmtUtils]: Spent 412ms on a formula simplification. DAG size of input: 218 DAG size of output 179 [2018-01-29 22:34:58,983 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 128 DAG size of output 105 [2018-01-29 22:34:59,269 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-01-29 22:34:59,562 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 134 DAG size of output 115 [2018-01-29 22:34:59,820 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 120 DAG size of output 101 [2018-01-29 22:35:00,363 WARN L146 SmtUtils]: Spent 390ms on a formula simplification. DAG size of input: 204 DAG size of output 170 [2018-01-29 22:35:00,997 WARN L146 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 207 DAG size of output 170 [2018-01-29 22:35:01,314 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 122 DAG size of output 100 [2018-01-29 22:35:01,585 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 124 DAG size of output 106 [2018-01-29 22:35:01,868 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 128 DAG size of output 110 [2018-01-29 22:35:02,125 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 114 DAG size of output 96 [2018-01-29 22:35:02,661 WARN L146 SmtUtils]: Spent 373ms on a formula simplification. DAG size of input: 193 DAG size of output 161 [2018-01-29 22:35:03,280 WARN L146 SmtUtils]: Spent 373ms on a formula simplification. DAG size of input: 196 DAG size of output 161 [2018-01-29 22:35:03,593 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 116 DAG size of output 95 [2018-01-29 22:35:03,867 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 118 DAG size of output 101 [2018-01-29 22:35:04,155 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 122 DAG size of output 105 [2018-01-29 22:35:04,398 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 108 DAG size of output 91 [2018-01-29 22:35:04,909 WARN L146 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 182 DAG size of output 152 [2018-01-29 22:35:05,529 WARN L146 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 185 DAG size of output 152 [2018-01-29 22:35:05,832 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 110 DAG size of output 90 [2018-01-29 22:35:06,090 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 112 DAG size of output 96 [2018-01-29 22:35:06,359 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 116 DAG size of output 100 [2018-01-29 22:35:06,600 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-01-29 22:35:07,074 WARN L146 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 171 DAG size of output 143 [2018-01-29 22:35:07,755 WARN L146 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 174 DAG size of output 143 [2018-01-29 22:35:08,033 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 104 DAG size of output 85 [2018-01-29 22:35:08,275 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 106 DAG size of output 91 [2018-01-29 22:35:08,520 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 110 DAG size of output 95 [2018-01-29 22:35:08,734 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-01-29 22:35:09,171 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 160 DAG size of output 134 [2018-01-29 22:35:09,694 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 163 DAG size of output 134 [2018-01-29 22:35:09,974 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 98 DAG size of output 80 [2018-01-29 22:35:10,211 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-01-29 22:35:10,454 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 104 DAG size of output 90 [2018-01-29 22:35:10,656 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 90 DAG size of output 76 [2018-01-29 22:35:11,054 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 149 DAG size of output 125 [2018-01-29 22:35:11,529 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 152 DAG size of output 125 [2018-01-29 22:35:11,789 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 92 DAG size of output 75 [2018-01-29 22:35:12,008 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 94 DAG size of output 81 [2018-01-29 22:35:12,231 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 98 DAG size of output 85 [2018-01-29 22:35:12,425 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 84 DAG size of output 71 [2018-01-29 22:35:12,795 WARN L146 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 138 DAG size of output 116 [2018-01-29 22:35:13,259 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 141 DAG size of output 116 [2018-01-29 22:35:13,714 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 88 DAG size of output 76 [2018-01-29 22:35:13,927 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 92 DAG size of output 80 [2018-01-29 22:35:14,453 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 127 DAG size of output 107 [2018-01-29 22:35:14,869 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 130 DAG size of output 107 [2018-01-29 22:35:16,005 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 116 DAG size of output 98 [2018-01-29 22:35:16,394 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 119 DAG size of output 98 [2018-01-29 22:35:17,470 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 105 DAG size of output 89 [2018-01-29 22:35:17,841 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-01-29 22:35:18,839 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 94 DAG size of output 80 [2018-01-29 22:35:19,172 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-29 22:35:20,079 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-29 22:35:20,382 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 86 DAG size of output 71 [2018-01-29 22:35:21,541 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-01-29 22:35:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:35:24,438 INFO L93 Difference]: Finished difference Result 666 states and 730 transitions. [2018-01-29 22:35:24,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2018-01-29 22:35:24,438 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 340 [2018-01-29 22:35:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:35:24,440 INFO L225 Difference]: With dead ends: 666 [2018-01-29 22:35:24,440 INFO L226 Difference]: Without dead ends: 663 [2018-01-29 22:35:24,447 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53388 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=21895, Invalid=114635, Unknown=0, NotChecked=0, Total=136530 [2018-01-29 22:35:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-01-29 22:35:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 659. [2018-01-29 22:35:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-01-29 22:35:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 660 transitions. [2018-01-29 22:35:24,473 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 660 transitions. Word has length 340 [2018-01-29 22:35:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:35:24,473 INFO L432 AbstractCegarLoop]: Abstraction has 659 states and 660 transitions. [2018-01-29 22:35:24,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-01-29 22:35:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 660 transitions. [2018-01-29 22:35:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-01-29 22:35:24,476 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:35:24,477 INFO L350 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:35:24,477 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-29 22:35:24,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1575254769, now seen corresponding path program 10 times [2018-01-29 22:35:24,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:35:24,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:35:24,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:24,478 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:35:24,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:35:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:35:24,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:35:30,391 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 21 DAG size of output 19 [2018-01-29 22:35:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13950 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:35:38,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:35:38,569 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:35:38,575 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:35:38,811 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:35:38,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:35:38,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 8 treesize of output 7 [2018-01-29 22:35:38,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:38,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:38,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 22:35:39,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:39,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:39,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-29 22:35:39,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:39,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:39,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:39,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:39,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:39,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:39,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:39,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:39,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:39,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:39,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:39,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:39,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:40,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:40,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:40,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:40,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:40,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:40,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:40,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:40,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:40,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:40,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:40,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:40,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:40,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:41,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:41,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:41,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:41,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:41,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:41,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:41,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:41,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:41,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:41,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:41,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:41,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:41,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:42,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:42,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:42,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:42,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:42,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:42,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:42,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:42,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:42,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:42,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:42,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:42,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:42,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:43,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:43,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:43,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:43,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:43,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:43,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:43,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:43,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:43,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:43,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 10 treesize of output 9 [2018-01-29 22:35:43,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:43,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:19 [2018-01-29 22:35:44,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-01-29 22:35:44,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-01-29 22:35:44,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:44,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:44,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:44,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:28 [2018-01-29 22:35:45,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:45,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:45,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-01-29 22:35:45,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:45,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-01-29 22:35:45,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:45,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:45,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-01-29 22:35:45,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:45,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:45,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:45,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:25 [2018-01-29 22:35:46,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-01-29 22:35:46,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-01-29 22:35:46,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:46,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:46,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:46,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:34 [2018-01-29 22:35:47,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:47,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:47,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:47,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:47,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:47,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:47,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:47,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:47,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:47,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:47,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:47,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:48,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:48,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:48,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:48,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:48,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:48,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:48,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:48,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:48,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:48,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:48,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:48,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:48,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:49,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:49,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:49,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:49,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:49,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:49,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:49,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:49,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:49,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:49,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:49,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:49,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:31 [2018-01-29 22:35:50,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-01-29 22:35:50,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-01-29 22:35:50,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:50,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:50,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:50,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:40 [2018-01-29 22:35:51,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:51,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:51,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:51,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:51,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:51,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:51,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:51,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:51,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:51,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:52,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:52,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:52,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:52,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:52,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:52,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:52,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:52,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:52,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:52,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:53,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:53,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 22:35:53,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:53,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 22:35:53,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 11 [2018-01-29 22:35:53,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:35:53,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 22:35:54,178 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-29 22:35:54,188 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-29 22:35:54,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:35:54,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:35:54,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:35:54,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-29 22:35:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 13950 backedges. 0 proven. 13950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:35:56,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:35:56,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 109] total 204 [2018-01-29 22:35:56,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-01-29 22:35:56,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-01-29 22:35:56,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=41175, Unknown=0, NotChecked=0, Total=41820 [2018-01-29 22:35:56,390 INFO L87 Difference]: Start difference. First operand 659 states and 660 transitions. Second operand 205 states. Received shutdown request... [2018-01-29 22:35:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:35:57,039 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 22:35:57,044 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 22:35:57,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:35:57 BoogieIcfgContainer [2018-01-29 22:35:57,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:35:57,045 INFO L168 Benchmark]: Toolchain (without parser) took 134829.40 ms. Allocated memory was 301.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 261.5 MB in the beginning and 833.0 MB in the end (delta: -571.5 MB). Peak memory consumption was 570.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:35:57,046 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:35:57,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.02 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-29 22:35:57,046 INFO L168 Benchmark]: Boogie Preprocessor took 36.60 ms. Allocated memory is still 301.5 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-29 22:35:57,046 INFO L168 Benchmark]: RCFGBuilder took 253.01 ms. Allocated memory is still 301.5 MB. Free memory was 249.4 MB in the beginning and 231.7 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:35:57,046 INFO L168 Benchmark]: TraceAbstraction took 134329.72 ms. Allocated memory was 301.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 231.7 MB in the beginning and 833.0 MB in the end (delta: -601.3 MB). Peak memory consumption was 541.1 MB. Max. memory is 5.3 GB. [2018-01-29 22:35:57,048 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.18 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.02 ms. Allocated memory is still 301.5 MB. Free memory was 260.5 MB in the beginning and 250.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.60 ms. Allocated memory is still 301.5 MB. Free memory was 250.4 MB in the beginning and 249.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 253.01 ms. Allocated memory is still 301.5 MB. Free memory was 249.4 MB in the beginning and 231.7 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 134329.72 ms. Allocated memory was 301.5 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 231.7 MB in the beginning and 833.0 MB in the end (delta: -601.3 MB). Peak memory consumption was 541.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (659states) and interpolant automaton (currently 5 states, 205 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 11 error locations. TIMEOUT Result, 134.2s OverallTime, 16 OverallIterations, 46 TraceHistogramMax, 79.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 821 SDtfs, 9451 SDslu, 17971 SDs, 0 SdLazy, 24262 SolverSat, 1376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2731 GetRequests, 1494 SyntacticMatches, 42 SemanticMatches, 1195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81145 ImplicationChecksByTransitivity, 102.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 65 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 49.3s InterpolantComputationTime, 3660 NumberOfCodeBlocks, 3656 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3633 ConstructedInterpolants, 130 QuantifiedInterpolants, 35165162 SizeOfPredicates, 700 NumberOfNonLiveVariables, 5558 ConjunctsInSsa, 1201 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 0/39624 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-35-57-054.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-35-57-054.csv Completed graceful shutdown