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/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:15:09,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:15:09,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:15:09,681 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:15:09,682 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:15:09,683 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:15:09,684 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:15:09,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:15:09,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:15:09,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:15:09,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:15:09,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:15:09,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:15:09,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:15:09,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:15:09,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:15:09,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:15:09,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:15:09,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:15:09,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:15:09,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:15:09,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:15:09,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:15:09,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:15:09,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:15:09,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:15:09,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:15:09,707 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:15:09,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:15:09,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:15:09,708 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:15:09,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:15:09,718 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:15:09,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:15:09,719 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:15:09,720 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:15:09,720 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:15:09,720 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:15:09,720 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:15:09,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:15:09,721 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:15:09,721 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:15:09,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:15:09,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:15:09,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:15:09,722 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:15:09,722 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:15:09,722 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:15:09,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:15:09,723 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:15:09,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:15:09,723 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:15:09,723 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:15:09,724 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:15:09,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:15:09,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:15:09,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:15:09,724 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:15:09,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:15:09,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:15:09,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:15:09,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:15:09,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:15:09,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:15:09,726 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:15:09,727 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:15:09,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:15:09,773 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:15:09,776 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:15:09,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:15:09,777 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:15:09,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-30 00:15:09,958 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:15:09,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:15:09,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:15:09,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:15:09,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:15:09,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:15:09" (1/1) ... [2018-01-30 00:15:09,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4082e511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:09, skipping insertion in model container [2018-01-30 00:15:09,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:15:09" (1/1) ... [2018-01-30 00:15:09,987 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:15:10,036 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:15:10,156 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:15:10,174 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:15:10,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10 WrapperNode [2018-01-30 00:15:10,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:15:10,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:15:10,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:15:10,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:15:10,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... [2018-01-30 00:15:10,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:15:10,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:15:10,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:15:10,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:15:10,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:15:10,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:15:10,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:15:10,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:15:10,263 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:15:10,263 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:15:10,263 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:15:10,264 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:15:10,264 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:15:10,264 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:15:10,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:15:10,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:15:10,493 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:15:10,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:15:10 BoogieIcfgContainer [2018-01-30 00:15:10,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:15:10,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:15:10,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:15:10,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:15:10,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:15:09" (1/3) ... [2018-01-30 00:15:10,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0af262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:15:10, skipping insertion in model container [2018-01-30 00:15:10,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:15:10" (2/3) ... [2018-01-30 00:15:10,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0af262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:15:10, skipping insertion in model container [2018-01-30 00:15:10,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:15:10" (3/3) ... [2018-01-30 00:15:10,500 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-30 00:15:10,508 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:15:10,514 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 00:15:10,564 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:15:10,565 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:15:10,565 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:15:10,565 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:15:10,565 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:15:10,565 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:15:10,566 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:15:10,566 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:15:10,567 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:15:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-30 00:15:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:15:10,595 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:10,596 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] [2018-01-30 00:15:10,596 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2118854820, now seen corresponding path program 1 times [2018-01-30 00:15:10,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:10,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:10,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:10,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:10,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:10,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:10,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:10,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:15:10,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:15:10,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:15:10,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:15:10,919 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-30 00:15:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,056 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-01-30 00:15:11,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:15:11,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-30 00:15:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:11,072 INFO L225 Difference]: With dead ends: 118 [2018-01-30 00:15:11,072 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 00:15:11,076 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:15:11,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 00:15:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-01-30 00:15:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 00:15:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-30 00:15:11,128 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 22 [2018-01-30 00:15:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:11,128 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-30 00:15:11,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:15:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-30 00:15:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:15:11,131 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:11,131 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] [2018-01-30 00:15:11,131 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:11,131 INFO L82 PathProgramCache]: Analyzing trace with hash -356759092, now seen corresponding path program 1 times [2018-01-30 00:15:11,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:11,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:11,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:11,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:11,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:11,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:11,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:15:11,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:11,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:11,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:11,254 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-01-30 00:15:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,347 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-01-30 00:15:11,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:11,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-30 00:15:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:11,348 INFO L225 Difference]: With dead ends: 98 [2018-01-30 00:15:11,349 INFO L226 Difference]: Without dead ends: 94 [2018-01-30 00:15:11,349 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-30 00:15:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 57. [2018-01-30 00:15:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-30 00:15:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-30 00:15:11,356 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 23 [2018-01-30 00:15:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:11,356 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-30 00:15:11,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-30 00:15:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:15:11,357 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:11,357 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:11,358 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash 15601453, now seen corresponding path program 1 times [2018-01-30 00:15:11,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:11,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:11,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:11,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:11,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:11,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:11,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:11,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:15:11,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:15:11,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:15:11,432 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2018-01-30 00:15:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,474 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-30 00:15:11,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:15:11,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-30 00:15:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:11,476 INFO L225 Difference]: With dead ends: 107 [2018-01-30 00:15:11,476 INFO L226 Difference]: Without dead ends: 59 [2018-01-30 00:15:11,476 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-30 00:15:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-30 00:15:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-30 00:15:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-01-30 00:15:11,484 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 28 [2018-01-30 00:15:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:11,484 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-01-30 00:15:11,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:15:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-01-30 00:15:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:15:11,486 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:11,486 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:11,486 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash -204345955, now seen corresponding path program 1 times [2018-01-30 00:15:11,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:11,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:11,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:11,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:11,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:11,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:11,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:11,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:11,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:11,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:11,611 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-01-30 00:15:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,681 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-30 00:15:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:15:11,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-30 00:15:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:11,683 INFO L225 Difference]: With dead ends: 59 [2018-01-30 00:15:11,683 INFO L226 Difference]: Without dead ends: 58 [2018-01-30 00:15:11,683 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-30 00:15:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-30 00:15:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-30 00:15:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-30 00:15:11,690 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 29 [2018-01-30 00:15:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:11,691 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-30 00:15:11,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-30 00:15:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:15:11,692 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:11,692 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:11,693 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -204345954, now seen corresponding path program 1 times [2018-01-30 00:15:11,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:11,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:11,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:11,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:11,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:11,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:11,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:11,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:11,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:11,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:11,754 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 6 states. [2018-01-30 00:15:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,876 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-30 00:15:11,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:11,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-30 00:15:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:11,878 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:15:11,878 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 00:15:11,878 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 00:15:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-30 00:15:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 00:15:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-30 00:15:11,886 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 29 [2018-01-30 00:15:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:11,887 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-30 00:15:11,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-30 00:15:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:15:11,888 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:11,888 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:11,888 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash -204345906, now seen corresponding path program 1 times [2018-01-30 00:15:11,889 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:11,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:11,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:11,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:11,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:11,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:11,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:15:11,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:15:11,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:15:11,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:15:11,962 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 4 states. [2018-01-30 00:15:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:11,999 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-01-30 00:15:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:15:12,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-30 00:15:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:12,001 INFO L225 Difference]: With dead ends: 114 [2018-01-30 00:15:12,001 INFO L226 Difference]: Without dead ends: 91 [2018-01-30 00:15:12,002 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:15:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-30 00:15:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2018-01-30 00:15:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 00:15:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-30 00:15:12,012 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 29 [2018-01-30 00:15:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:12,012 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-30 00:15:12,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:15:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-30 00:15:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:15:12,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:12,014 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:12,014 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1456085898, now seen corresponding path program 1 times [2018-01-30 00:15:12,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:12,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:12,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:12,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:12,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:12,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:12,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:15:12,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:15:12,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:15:12,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:15:12,105 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2018-01-30 00:15:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:12,168 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-01-30 00:15:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:15:12,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-30 00:15:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:12,170 INFO L225 Difference]: With dead ends: 132 [2018-01-30 00:15:12,171 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 00:15:12,171 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 00:15:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2018-01-30 00:15:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 00:15:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-30 00:15:12,182 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 37 [2018-01-30 00:15:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:12,182 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-30 00:15:12,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:15:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-30 00:15:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:15:12,184 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:12,184 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:12,184 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1626330386, now seen corresponding path program 1 times [2018-01-30 00:15:12,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:12,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:12,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:12,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:12,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:12,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:12,377 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:15:12,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:12,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:12,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:15:12,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:15:12,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:12,542 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:12,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-30 00:15:12,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:12,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 00:15:12,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-30 00:15:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:12,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:12,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-30 00:15:12,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:15:12,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:15:12,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:15:12,639 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 11 states. [2018-01-30 00:15:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:12,962 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2018-01-30 00:15:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:15:12,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-30 00:15:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:12,965 INFO L225 Difference]: With dead ends: 91 [2018-01-30 00:15:12,965 INFO L226 Difference]: Without dead ends: 88 [2018-01-30 00:15:12,966 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:15:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-30 00:15:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2018-01-30 00:15:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 00:15:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-30 00:15:12,977 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 38 [2018-01-30 00:15:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:12,977 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-30 00:15:12,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:15:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-30 00:15:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:15:12,979 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:12,979 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:12,980 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1626330387, now seen corresponding path program 1 times [2018-01-30 00:15:12,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:12,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:12,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:12,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:13,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:13,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:13,504 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:15:13,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:13,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:13,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-30 00:15:13,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,577 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 23 treesize of output 22 [2018-01-30 00:15:13,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-30 00:15:13,581 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,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 22 treesize of output 21 [2018-01-30 00:15:13,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:15:13,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:15:13,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-30 00:15:13,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:13,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:13,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-01-30 00:15:13,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:14,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:14,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:14,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-30 00:15:14,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:14,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:15:14,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-30 00:15:14,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:15:14,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:15:14,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-30 00:15:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:15:14,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:14,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-30 00:15:14,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:15:14,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:15:14,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-30 00:15:14,206 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 21 states. [2018-01-30 00:15:14,550 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-30 00:15:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:58,548 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-01-30 00:15:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 00:15:58,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-30 00:15:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:58,550 INFO L225 Difference]: With dead ends: 141 [2018-01-30 00:15:58,550 INFO L226 Difference]: Without dead ends: 140 [2018-01-30 00:15:58,551 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-30 00:15:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-30 00:15:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 71. [2018-01-30 00:15:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 00:15:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-01-30 00:15:58,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 38 [2018-01-30 00:15:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:58,565 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-01-30 00:15:58,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:15:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-01-30 00:15:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-30 00:15:58,566 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:58,566 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:58,566 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash -916219476, now seen corresponding path program 1 times [2018-01-30 00:15:58,567 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:58,567 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:58,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:58,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:58,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:58,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:58,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:58,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:15:58,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:15:58,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:15:58,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:15:58,607 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 4 states. [2018-01-30 00:15:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:58,653 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-30 00:15:58,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:15:58,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-30 00:15:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:58,655 INFO L225 Difference]: With dead ends: 101 [2018-01-30 00:15:58,655 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 00:15:58,655 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-30 00:15:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 00:15:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-01-30 00:15:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 00:15:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-01-30 00:15:58,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 40 [2018-01-30 00:15:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:58,674 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-01-30 00:15:58,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:15:58,674 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-01-30 00:15:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:15:58,675 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:58,675 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:58,675 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:58,675 INFO L82 PathProgramCache]: Analyzing trace with hash -578645626, now seen corresponding path program 1 times [2018-01-30 00:15:58,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:58,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:58,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:58,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:58,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:58,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:58,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:58,798 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:15:58,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:58,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:15:58,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:58,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-30 00:15:58,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 00:15:58,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 00:15:58,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-30 00:15:58,950 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 13 states. [2018-01-30 00:15:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:59,206 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-30 00:15:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:15:59,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-30 00:15:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:59,207 INFO L225 Difference]: With dead ends: 85 [2018-01-30 00:15:59,207 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 00:15:59,208 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-30 00:15:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 00:15:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-30 00:15:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 00:15:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-01-30 00:15:59,223 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 43 [2018-01-30 00:15:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:59,223 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-01-30 00:15:59,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 00:15:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-01-30 00:15:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 00:15:59,224 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:59,225 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:59,225 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1929970958, now seen corresponding path program 1 times [2018-01-30 00:15:59,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:59,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:59,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:59,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:59,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:59,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:15:59,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:15:59,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:15:59,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:15:59,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:15:59,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:15:59,279 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 6 states. [2018-01-30 00:15:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:59,340 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-01-30 00:15:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:59,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-30 00:15:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:59,342 INFO L225 Difference]: With dead ends: 118 [2018-01-30 00:15:59,342 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 00:15:59,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:15:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 00:15:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2018-01-30 00:15:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-30 00:15:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-30 00:15:59,359 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 44 [2018-01-30 00:15:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:59,359 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-30 00:15:59,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:15:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-30 00:15:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 00:15:59,361 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:59,361 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:59,361 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1808851570, now seen corresponding path program 1 times [2018-01-30 00:15:59,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:59,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:59,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:59,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:59,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:59,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:15:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:15:59,457 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:15:59,458 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:15:59,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:59,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:15:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:15:59,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:15:59,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-30 00:15:59,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:15:59,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:15:59,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:15:59,728 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-30 00:15:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:15:59,893 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-01-30 00:15:59,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:15:59,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-01-30 00:15:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:15:59,894 INFO L225 Difference]: With dead ends: 131 [2018-01-30 00:15:59,894 INFO L226 Difference]: Without dead ends: 108 [2018-01-30 00:15:59,894 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:15:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-30 00:15:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 76. [2018-01-30 00:15:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-30 00:15:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-30 00:15:59,908 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 47 [2018-01-30 00:15:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:15:59,908 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-30 00:15:59,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:15:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-30 00:15:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 00:15:59,909 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:15:59,909 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:15:59,910 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:15:59,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1945346733, now seen corresponding path program 1 times [2018-01-30 00:15:59,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:15:59,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:15:59,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:59,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:15:59,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:15:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:15:59,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:00,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:00,361 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:00,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:00,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:00,418 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 23 treesize of output 22 [2018-01-30 00:16:00,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:00,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-30 00:16:00,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:00,448 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 25 treesize of output 24 [2018-01-30 00:16:00,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:00,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:16:00,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:00,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:16:00,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:16:00,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:00,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:00,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-01-30 00:16:00,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:00,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:00,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:00,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:16:00,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:00,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:00,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-30 00:16:01,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:16:01,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:01,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:01,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34 [2018-01-30 00:16:01,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:01,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:01,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-30 00:16:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:01,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:01,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-30 00:16:01,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:16:01,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:16:01,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=719, Unknown=1, NotChecked=0, Total=812 [2018-01-30 00:16:01,305 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 29 states. [2018-01-30 00:16:01,653 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-30 00:16:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:02,645 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2018-01-30 00:16:02,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-30 00:16:02,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-01-30 00:16:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:02,647 INFO L225 Difference]: With dead ends: 125 [2018-01-30 00:16:02,647 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:16:02,647 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=220, Invalid=1581, Unknown=5, NotChecked=0, Total=1806 [2018-01-30 00:16:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:16:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 81. [2018-01-30 00:16:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-30 00:16:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-30 00:16:02,658 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 56 [2018-01-30 00:16:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:02,658 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-30 00:16:02,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:16:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-30 00:16:02,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-30 00:16:02,659 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:02,659 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:02,659 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:02,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1619062292, now seen corresponding path program 1 times [2018-01-30 00:16:02,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:02,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:02,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:02,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:02,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:02,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:02,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:02,838 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:02,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:02,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-30 00:16:03,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:03,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-30 00:16:03,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 00:16:03,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 00:16:03,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:16:03,064 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 15 states. [2018-01-30 00:16:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:03,429 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-01-30 00:16:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:16:03,429 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-01-30 00:16:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:03,430 INFO L225 Difference]: With dead ends: 114 [2018-01-30 00:16:03,430 INFO L226 Difference]: Without dead ends: 113 [2018-01-30 00:16:03,430 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:16:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-30 00:16:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2018-01-30 00:16:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 00:16:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-30 00:16:03,444 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 58 [2018-01-30 00:16:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:03,445 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-30 00:16:03,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 00:16:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-30 00:16:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:16:03,445 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:03,445 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:03,446 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1348676510, now seen corresponding path program 1 times [2018-01-30 00:16:03,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:03,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:03,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:03,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:03,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:03,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-30 00:16:04,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:04,046 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:04,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:04,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:04,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:16:04,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:16:04,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:04,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:04,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:04,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-30 00:16:04,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-30 00:16:04,355 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:16:04,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-30 00:16:04,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:04,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:04,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:04,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-30 00:16:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:16:04,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:04,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-01-30 00:16:04,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 00:16:04,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 00:16:04,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:16:04,413 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 23 states. [2018-01-30 00:16:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:04,942 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-30 00:16:04,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:16:04,942 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-01-30 00:16:04,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:04,943 INFO L225 Difference]: With dead ends: 125 [2018-01-30 00:16:04,943 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 00:16:04,943 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:16:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 00:16:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2018-01-30 00:16:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:16:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-01-30 00:16:04,957 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 59 [2018-01-30 00:16:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:04,957 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-01-30 00:16:04,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 00:16:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-01-30 00:16:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 00:16:04,958 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:04,958 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:04,958 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1348676511, now seen corresponding path program 1 times [2018-01-30 00:16:04,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:04,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:04,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:04,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:04,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:04,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:16:05,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:05,419 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:05,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:05,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:05,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:16:05,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:16:05,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:16:05,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:16:05,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-30 00:16:05,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-30 00:16:05,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-30 00:16:05,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-30 00:16:05,652 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:16:05,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-30 00:16:05,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:05,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-30 00:16:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:16:05,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:05,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2018-01-30 00:16:05,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 00:16:05,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 00:16:05,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-01-30 00:16:05,687 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 25 states. [2018-01-30 00:16:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:06,209 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-30 00:16:06,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 00:16:06,209 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-01-30 00:16:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:06,210 INFO L225 Difference]: With dead ends: 103 [2018-01-30 00:16:06,210 INFO L226 Difference]: Without dead ends: 102 [2018-01-30 00:16:06,210 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2018-01-30 00:16:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-30 00:16:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-01-30 00:16:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 00:16:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-30 00:16:06,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 59 [2018-01-30 00:16:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:06,225 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-30 00:16:06,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 00:16:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-30 00:16:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-30 00:16:06,226 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:06,226 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:06,226 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1003409082, now seen corresponding path program 1 times [2018-01-30 00:16:06,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:06,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:06,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:06,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:06,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:06,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:16:06,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:06,303 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:06,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:06,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:16:06,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:16:06,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-01-30 00:16:06,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:16:06,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:16:06,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:16:06,393 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 8 states. [2018-01-30 00:16:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:06,504 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-30 00:16:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:16:06,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-30 00:16:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:06,505 INFO L225 Difference]: With dead ends: 105 [2018-01-30 00:16:06,505 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 00:16:06,506 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:16:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 00:16:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-30 00:16:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-30 00:16:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-30 00:16:06,518 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 61 [2018-01-30 00:16:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:06,519 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-30 00:16:06,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:16:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-30 00:16:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 00:16:06,519 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:06,519 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:06,519 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1057480014, now seen corresponding path program 2 times [2018-01-30 00:16:06,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:06,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:06,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:06,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:06,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:06,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:16:06,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:06,616 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:06,626 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:16:06,641 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:16:06,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:16:06,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 00:16:06,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:16:06,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-01-30 00:16:06,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 00:16:06,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 00:16:06,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:16:06,746 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 12 states. [2018-01-30 00:16:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:07,182 INFO L93 Difference]: Finished difference Result 194 states and 209 transitions. [2018-01-30 00:16:07,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 00:16:07,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-01-30 00:16:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:07,183 INFO L225 Difference]: With dead ends: 194 [2018-01-30 00:16:07,183 INFO L226 Difference]: Without dead ends: 172 [2018-01-30 00:16:07,184 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2018-01-30 00:16:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-30 00:16:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 109. [2018-01-30 00:16:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-30 00:16:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-01-30 00:16:07,206 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 65 [2018-01-30 00:16:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:07,206 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-01-30 00:16:07,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 00:16:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-01-30 00:16:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 00:16:07,207 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:07,207 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:07,207 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:07,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1652416881, now seen corresponding path program 1 times [2018-01-30 00:16:07,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:07,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:07,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:07,208 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:16:07,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:07,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 00:16:07,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:07,547 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-30 00:16:07,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:07,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:07,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 00:16:07,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:16:07,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:07,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:07,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-30 00:16:07,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-30 00:16:07,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-30 00:16:07,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:16:07,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-30 00:16:07,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-30 00:16:07,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:07,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 00:16:07,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-01-30 00:16:11,780 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-30 00:16:11,926 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 24 treesize of output 20 [2018-01-30 00:16:11,929 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:16:11,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-30 00:16:11,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:11,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:11,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:11,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-01-30 00:16:11,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:16:11,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-01-30 00:16:11,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:12,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-30 00:16:12,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-30 00:16:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:16:12,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:12,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 30 [2018-01-30 00:16:12,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-30 00:16:12,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-30 00:16:12,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=836, Unknown=1, NotChecked=0, Total=930 [2018-01-30 00:16:12,111 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 31 states. [2018-01-30 00:16:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:43,379 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-01-30 00:16:43,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:16:43,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-01-30 00:16:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:43,381 INFO L225 Difference]: With dead ends: 124 [2018-01-30 00:16:43,381 INFO L226 Difference]: Without dead ends: 122 [2018-01-30 00:16:43,382 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=262, Invalid=1993, Unknown=1, NotChecked=0, Total=2256 [2018-01-30 00:16:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-30 00:16:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2018-01-30 00:16:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:16:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-30 00:16:43,407 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 66 [2018-01-30 00:16:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:43,407 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-30 00:16:43,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-30 00:16:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-30 00:16:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 00:16:43,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:43,408 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:43,409 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:43,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1652416929, now seen corresponding path program 1 times [2018-01-30 00:16:43,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:43,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:43,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:43,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:43,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:43,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:16:43,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:43,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:43,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:43,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 00:16:43,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:16:43,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-30 00:16:43,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:16:43,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:16:43,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:16:43,579 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 10 states. [2018-01-30 00:16:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:16:43,709 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-01-30 00:16:43,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:16:43,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-01-30 00:16:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:16:43,710 INFO L225 Difference]: With dead ends: 137 [2018-01-30 00:16:43,710 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:16:43,711 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:16:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:16:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-30 00:16:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 00:16:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-01-30 00:16:43,739 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 66 [2018-01-30 00:16:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:16:43,739 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-01-30 00:16:43,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:16:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-01-30 00:16:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:16:43,740 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:16:43,740 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:16:43,740 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:16:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1763817103, now seen corresponding path program 1 times [2018-01-30 00:16:43,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:16:43,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:16:43,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:43,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:43,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:16:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:43,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:16:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-30 00:16:44,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:16:44,946 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:16:44,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:16:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:16:44,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:16:45,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-30 00:16:45,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:16:45,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:45,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:45,265 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 49 treesize of output 46 [2018-01-30 00:16:45,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-30 00:16:45,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:45,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:16:45,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:16:45,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-30 00:16:45,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-01-30 00:16:45,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:45,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2018-01-30 00:16:45,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:16:45,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:16:45,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-30 00:16:46,557 WARN L146 SmtUtils]: Spent 846ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-01-30 00:16:54,746 WARN L146 SmtUtils]: Spent 4048ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-01-30 00:16:56,867 WARN L143 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 66 [2018-01-30 00:17:00,979 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 67 [2018-01-30 00:17:00,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-01-30 00:17:01,001 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:17:01,002 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:17:01,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 104 [2018-01-30 00:17:01,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:01,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2018-01-30 00:17:01,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:01,134 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:17:01,135 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:17:01,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 104 [2018-01-30 00:17:01,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:01,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:17:01,209 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 75 treesize of output 67 [2018-01-30 00:17:01,211 INFO L682 Elim1Store]: detected equality via solver [2018-01-30 00:17:01,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-01-30 00:17:01,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:01,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:17:01,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:17:01,249 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-01-30 00:17:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-30 00:17:03,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:17:03,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2018-01-30 00:17:03,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-30 00:17:03,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-30 00:17:03,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1337, Unknown=40, NotChecked=0, Total=1482 [2018-01-30 00:17:03,586 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 39 states. [2018-01-30 00:17:13,513 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 111 DAG size of output 44 [2018-01-30 00:17:14,153 WARN L146 SmtUtils]: Spent 541ms on a formula simplification. DAG size of input: 115 DAG size of output 40 [2018-01-30 00:17:14,432 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 134 DAG size of output 45 [2018-01-30 00:17:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:17:19,899 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-30 00:17:19,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:17:19,900 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 69 [2018-01-30 00:17:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:17:19,900 INFO L225 Difference]: With dead ends: 120 [2018-01-30 00:17:19,900 INFO L226 Difference]: Without dead ends: 97 [2018-01-30 00:17:19,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=256, Invalid=2747, Unknown=77, NotChecked=0, Total=3080 [2018-01-30 00:17:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-30 00:17:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-30 00:17:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-30 00:17:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-30 00:17:19,918 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 69 [2018-01-30 00:17:19,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:17:19,918 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-30 00:17:19,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-30 00:17:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-30 00:17:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-30 00:17:19,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:17:19,920 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:17:19,920 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-30 00:17:19,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1766894189, now seen corresponding path program 2 times [2018-01-30 00:17:19,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:17:19,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:17:19,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:17:19,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:17:19,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:17:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:17:19,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:17:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:17:20,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:17:20,610 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 00:17:20,615 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:17:20,628 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:17:20,638 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:17:20,646 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:17:20,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:17:20,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-30 00:17:20,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:20,686 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 23 treesize of output 22 [2018-01-30 00:17:20,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:20,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-30 00:17:20,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:20,702 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 25 treesize of output 24 [2018-01-30 00:17:20,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:20,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:17:20,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-30 00:17:21,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-01-30 00:17:21,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:21,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-01-30 00:17:21,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:21,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-30 00:17:21,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:21,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:21,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-30 00:17:21,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:21,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-30 00:17:21,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-30 00:17:21,424 WARN L143 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-30 00:17:21,711 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-01-30 00:17:22,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-01-30 00:17:22,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:22,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-01-30 00:17:22,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:22,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-30 00:17:22,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:22,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-30 00:17:22,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:22,632 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-01-30 00:17:22,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:22,958 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,961 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:22,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-01-30 00:17:22,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:23,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-30 00:17:23,273 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:23,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-30 00:17:23,277 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:23,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 80 [2018-01-30 00:17:23,544 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:23,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-30 00:17:23,913 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:23,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:23,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-30 00:17:23,918 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:24,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-01-30 00:17:24,279 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-30 00:17:24,894 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-30 00:17:25,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-01-30 00:17:25,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:25,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 90 [2018-01-30 00:17:25,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:25,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:25,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 92 [2018-01-30 00:17:25,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:26,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 58 [2018-01-30 00:17:26,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:26,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 90 [2018-01-30 00:17:26,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-30 00:17:26,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-01-30 00:17:26,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:26,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:26,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-30 00:17:26,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:27,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-30 00:17:27,311 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:27,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-01-30 00:17:27,317 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:27,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-30 00:17:27,743 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:27,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:17:27,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-30 00:17:27,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-30 00:17:28,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 32 dim-0 vars, and 8 xjuncts. [2018-01-30 00:17:28,089 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-30 00:17:29,288 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-30 00:17:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-30 00:17:29,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:17:29,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-01-30 00:17:29,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 00:17:29,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 00:17:29,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1061, Unknown=1, NotChecked=0, Total=1190 [2018-01-30 00:17:29,365 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 35 states. [2018-01-30 00:17:29,586 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-30 00:17:29,775 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-30 00:17:42,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:17:42,276 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:17:42,281 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:17:42,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:17:42 BoogieIcfgContainer [2018-01-30 00:17:42,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:17:42,282 INFO L168 Benchmark]: Toolchain (without parser) took 152323.97 ms. Allocated memory was 306.7 MB in the beginning and 550.5 MB in the end (delta: 243.8 MB). Free memory was 265.7 MB in the beginning and 455.0 MB in the end (delta: -189.3 MB). Peak memory consumption was 54.5 MB. Max. memory is 5.3 GB. [2018-01-30 00:17:42,283 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:17:42,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.85 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 252.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:17:42,284 INFO L168 Benchmark]: Boogie Preprocessor took 31.96 ms. Allocated memory is still 306.7 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:17:42,284 INFO L168 Benchmark]: RCFGBuilder took 280.17 ms. Allocated memory is still 306.7 MB. Free memory was 250.7 MB in the beginning and 231.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:17:42,284 INFO L168 Benchmark]: TraceAbstraction took 151787.62 ms. Allocated memory was 306.7 MB in the beginning and 550.5 MB in the end (delta: 243.8 MB). Free memory was 231.9 MB in the beginning and 455.0 MB in the end (delta: -223.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:17:42,285 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.14 ms. Allocated memory is still 306.7 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.85 ms. Allocated memory is still 306.7 MB. Free memory was 265.7 MB in the beginning and 252.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.96 ms. Allocated memory is still 306.7 MB. Free memory was 252.7 MB in the beginning and 250.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.17 ms. Allocated memory is still 306.7 MB. Free memory was 250.7 MB in the beginning and 231.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 151787.62 ms. Allocated memory was 306.7 MB in the beginning and 550.5 MB in the end (delta: 243.8 MB). Free memory was 231.9 MB in the beginning and 455.0 MB in the end (delta: -223.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (97states) and interpolant automaton (currently 12 states, 35 states before enhancement), while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 9 error locations. TIMEOUT Result, 151.7s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 109.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1262 SDtfs, 1803 SDslu, 8232 SDs, 0 SdLazy, 5604 SolverSat, 275 SolverUnsat, 113 SolverUnknown, 0 SolverNotchecked, 85.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 730 SyntacticMatches, 30 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 54.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=20, 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.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 419 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.0s InterpolantComputationTime, 1879 NumberOfCodeBlocks, 1844 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1842 ConstructedInterpolants, 195 QuantifiedInterpolants, 1190204 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2184 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 421/712 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/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-17-42-294.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-17-42-294.csv Completed graceful shutdown