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_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:48:43,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:48:43,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:48:43,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:48:43,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:48:43,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:48:43,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:48:43,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:48:43,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:48:43,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:48:43,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:48:43,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:48:43,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:48:43,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:48:43,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:48:43,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:48:43,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:48:43,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:48:43,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:48:43,651 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:48:43,653 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:48:43,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:48:43,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:48:43,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:48:43,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:48:43,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:48:43,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:48:43,657 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:48:43,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:48:43,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:48:43,662 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:48:43,662 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-31 08:48:43,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:48:43,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:48:43,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:48:43,682 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:48:43,682 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:48:43,682 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:48:43,682 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:48:43,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:48:43,683 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:48:43,683 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:48:43,683 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:48:43,684 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:48:43,684 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:48:43,684 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:48:43,684 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:48:43,684 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:48:43,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:48:43,685 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:48:43,685 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:48:43,685 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:48:43,685 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:48:43,685 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:48:43,686 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:48:43,686 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:48:43,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:48:43,687 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:48:43,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:48:43,687 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:48:43,688 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:48:43,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:48:43,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:48:43,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:48:43,689 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:48:43,689 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:48:43,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:48:43,737 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:48:43,740 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:48:43,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:48:43,742 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:48:43,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-31 08:48:43,983 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:48:43,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:48:43,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:48:43,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:48:44,004 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:48:44,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:48:43" (1/1) ... [2018-01-31 08:48:44,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c884762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44, skipping insertion in model container [2018-01-31 08:48:44,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:48:43" (1/1) ... [2018-01-31 08:48:44,028 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:48:44,109 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:48:44,295 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:48:44,320 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:48:44,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44 WrapperNode [2018-01-31 08:48:44,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:48:44,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:48:44,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:48:44,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:48:44,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... [2018-01-31 08:48:44,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:48:44,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:48:44,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:48:44,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:48:44,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:48:44,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:48:44,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:48:44,438 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:48:44,439 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:48:44,439 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:48:44,439 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:48:44,439 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:48:44,439 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:48:44,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:48:44,440 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:48:44,440 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:48:44,440 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:48:44,440 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:48:44,440 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:48:44,441 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:48:44,441 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:48:44,441 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:48:44,441 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:48:44,880 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:48:44,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:48:44 BoogieIcfgContainer [2018-01-31 08:48:44,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:48:44,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:48:44,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:48:44,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:48:44,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:48:43" (1/3) ... [2018-01-31 08:48:44,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf57d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:48:44, skipping insertion in model container [2018-01-31 08:48:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:44" (2/3) ... [2018-01-31 08:48:44,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf57d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:48:44, skipping insertion in model container [2018-01-31 08:48:44,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:48:44" (3/3) ... [2018-01-31 08:48:44,890 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-31 08:48:44,896 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:48:44,903 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 08:48:44,946 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:48:44,946 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:48:44,946 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:48:44,946 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:48:44,947 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:48:44,947 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:48:44,947 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:48:44,947 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:48:44,948 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:48:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-31 08:48:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:48:44,977 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:44,978 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:48:44,978 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:44,983 INFO L82 PathProgramCache]: Analyzing trace with hash -175263290, now seen corresponding path program 1 times [2018-01-31 08:48:44,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:44,986 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:45,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:45,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:45,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:45,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:45,236 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-31 08:48:45,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:45,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:48:45,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:48:45,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:48:45,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:48:45,346 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-31 08:48:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:45,606 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-01-31 08:48:45,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:48:45,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-31 08:48:45,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:45,619 INFO L225 Difference]: With dead ends: 105 [2018-01-31 08:48:45,619 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:48:45,622 INFO L554 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-31 08:48:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:48:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-01-31 08:48:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:48:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-01-31 08:48:45,671 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 25 [2018-01-31 08:48:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:45,672 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-01-31 08:48:45,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:48:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-01-31 08:48:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:48:45,674 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:45,675 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:48:45,675 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -95214814, now seen corresponding path program 1 times [2018-01-31 08:48:45,675 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:45,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:45,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:45,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:45,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:45,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:45,852 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-31 08:48:45,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:45,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:48:45,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:48:45,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:48:45,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:48:45,855 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 6 states. [2018-01-31 08:48:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:46,094 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-01-31 08:48:46,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:48:46,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-31 08:48:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:46,130 INFO L225 Difference]: With dead ends: 108 [2018-01-31 08:48:46,130 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 08:48:46,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:48:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 08:48:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 75. [2018-01-31 08:48:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:48:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-01-31 08:48:46,149 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-01-31 08:48:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:46,150 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-01-31 08:48:46,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:48:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-01-31 08:48:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:48:46,152 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:46,152 INFO L351 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-31 08:48:46,152 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1326999554, now seen corresponding path program 1 times [2018-01-31 08:48:46,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:46,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:46,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:46,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:46,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:46,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:46,290 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-31 08:48:46,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:46,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:48:46,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:48:46,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:48:46,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:48:46,295 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2018-01-31 08:48:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:46,435 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2018-01-31 08:48:46,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:48:46,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-31 08:48:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:46,438 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:48:46,438 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:48:46,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:48:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:48:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 77. [2018-01-31 08:48:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 08:48:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-01-31 08:48:46,452 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 28 [2018-01-31 08:48:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:46,453 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-01-31 08:48:46,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:48:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-01-31 08:48:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:48:46,454 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:46,455 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:48:46,455 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash -822618111, now seen corresponding path program 1 times [2018-01-31 08:48:46,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:46,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:46,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:46,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:46,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:46,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:48:46,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:46,559 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-31 08:48:46,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:46,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:48:46,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:48:46,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-31 08:48:46,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:48:46,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:48:46,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:48:46,694 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2018-01-31 08:48:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:46,782 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2018-01-31 08:48:46,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:48:46,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-31 08:48:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:46,785 INFO L225 Difference]: With dead ends: 121 [2018-01-31 08:48:46,785 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 08:48:46,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:48:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 08:48:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-31 08:48:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 08:48:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-31 08:48:46,795 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 36 [2018-01-31 08:48:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:46,795 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-31 08:48:46,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:48:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-31 08:48:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:48:46,796 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:46,796 INFO L351 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-31 08:48:46,796 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1159121627, now seen corresponding path program 1 times [2018-01-31 08:48:46,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:46,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:46,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:46,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:46,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:46,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:46,961 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-31 08:48:46,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:46,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:48:46,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:48:46,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:48:46,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:48:46,965 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-01-31 08:48:47,180 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 10 [2018-01-31 08:48:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:47,290 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-31 08:48:47,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:48:47,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-31 08:48:47,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:47,292 INFO L225 Difference]: With dead ends: 110 [2018-01-31 08:48:47,293 INFO L226 Difference]: Without dead ends: 66 [2018-01-31 08:48:47,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:48:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-31 08:48:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-01-31 08:48:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 08:48:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-31 08:48:47,307 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 37 [2018-01-31 08:48:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:47,308 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-31 08:48:47,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:48:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-31 08:48:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:48:47,310 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:47,310 INFO L351 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-31 08:48:47,312 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:47,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2081203821, now seen corresponding path program 1 times [2018-01-31 08:48:47,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:47,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:47,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:47,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:47,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:47,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:47,611 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-31 08:48:47,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:47,611 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-31 08:48:47,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:47,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:47,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:48:47,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:47,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:48:47,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:48:47,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:47,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:47,937 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-31 08:48:47,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:47,965 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-31 08:48:47,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:48:48,012 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-31 08:48:48,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:48,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:48:48,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:48:48,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:48:48,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:48:48,047 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 11 states. [2018-01-31 08:48:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:48,997 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-31 08:48:48,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:48:48,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-31 08:48:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:48,999 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:48:48,999 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 08:48:49,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:48:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 08:48:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2018-01-31 08:48:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 08:48:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-31 08:48:49,013 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 38 [2018-01-31 08:48:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:49,014 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-31 08:48:49,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:48:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-31 08:48:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:48:49,015 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:49,015 INFO L351 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-31 08:48:49,015 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:49,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2081203820, now seen corresponding path program 1 times [2018-01-31 08:48:49,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:49,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:49,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:49,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:49,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:49,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:49,550 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:48:50,051 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-31 08:48:50,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:50,051 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-31 08:48:50,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:50,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:50,169 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-31 08:48:50,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,189 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-31 08:48:50,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,192 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-31 08:48:50,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,214 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-31 08:48:50,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:48:50,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:48:50,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:50,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:50,628 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-31 08:48:50,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:50,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 08:48:50,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:50,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:50,737 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-31 08:48:50,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:50,806 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-31 08:48:50,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:50,849 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-31 08:48:50,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:48:50,972 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-31 08:48:50,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:50,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-31 08:48:50,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:48:50,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:48:50,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-31 08:48:50,998 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 21 states. [2018-01-31 08:48:51,345 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:48:51,767 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:48:52,145 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-31 08:49:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:37,736 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2018-01-31 08:49:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:49:37,737 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-31 08:49:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:37,738 INFO L225 Difference]: With dead ends: 145 [2018-01-31 08:49:37,738 INFO L226 Difference]: Without dead ends: 143 [2018-01-31 08:49:37,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-31 08:49:37,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-31 08:49:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-01-31 08:49:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 08:49:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-01-31 08:49:37,766 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 38 [2018-01-31 08:49:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:37,767 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-01-31 08:49:37,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:49:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-01-31 08:49:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:49:37,772 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:37,773 INFO L351 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-31 08:49:37,773 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash 143153682, now seen corresponding path program 1 times [2018-01-31 08:49:37,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:37,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:37,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:37,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:37,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:37,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:37,853 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-31 08:49:37,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:49:37,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:49:37,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:49:37,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:49:37,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:49:37,854 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 4 states. [2018-01-31 08:49:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:37,895 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-01-31 08:49:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:49:37,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-31 08:49:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:37,897 INFO L225 Difference]: With dead ends: 115 [2018-01-31 08:49:37,897 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:49:37,897 INFO L554 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-31 08:49:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:49:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-01-31 08:49:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-31 08:49:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-01-31 08:49:37,920 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 40 [2018-01-31 08:49:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:37,920 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-01-31 08:49:37,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:49:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-01-31 08:49:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:49:37,923 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:37,923 INFO L351 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-31 08:49:37,923 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -212588640, now seen corresponding path program 1 times [2018-01-31 08:49:37,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:37,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:37,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:37,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:37,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:37,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:38,154 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-31 08:49:38,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:38,154 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-31 08:49:38,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:38,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:38,380 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-31 08:49:38,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:38,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-31 08:49:38,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:49:38,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:49:38,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-31 08:49:38,404 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 13 states. [2018-01-31 08:49:38,935 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 14 DAG size of output 12 [2018-01-31 08:49:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:39,601 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-31 08:49:39,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:49:39,629 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-31 08:49:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:39,630 INFO L225 Difference]: With dead ends: 99 [2018-01-31 08:49:39,630 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 08:49:39,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-31 08:49:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 08:49:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-31 08:49:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:49:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2018-01-31 08:49:39,650 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 43 [2018-01-31 08:49:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:39,650 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2018-01-31 08:49:39,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:49:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2018-01-31 08:49:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-31 08:49:39,654 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:39,654 INFO L351 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-31 08:49:39,655 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:39,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1746977166, now seen corresponding path program 1 times [2018-01-31 08:49:39,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:39,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:39,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:39,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:39,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:39,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:39,839 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-31 08:49:39,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:49:39,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:49:39,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:49:39,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:49:39,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:49:39,840 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand 6 states. [2018-01-31 08:49:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:39,869 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2018-01-31 08:49:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:49:39,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-31 08:49:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:39,871 INFO L225 Difference]: With dead ends: 115 [2018-01-31 08:49:39,871 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:49:39,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:49:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:49:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-01-31 08:49:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:49:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-01-31 08:49:39,884 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 44 [2018-01-31 08:49:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:39,885 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-01-31 08:49:39,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:49:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-01-31 08:49:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:49:39,886 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:39,886 INFO L351 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] [2018-01-31 08:49:39,886 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:39,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1150993881, now seen corresponding path program 1 times [2018-01-31 08:49:39,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:39,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:39,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:39,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:39,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:39,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:39,993 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-31 08:49:39,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:39,993 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-31 08:49:39,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:40,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:40,501 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-31 08:49:40,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:40,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-31 08:49:40,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:49:40,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:49:40,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:49:40,522 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 9 states. [2018-01-31 08:49:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:40,666 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2018-01-31 08:49:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:49:40,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-31 08:49:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:40,667 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:49:40,667 INFO L226 Difference]: Without dead ends: 110 [2018-01-31 08:49:40,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:49:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-31 08:49:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 85. [2018-01-31 08:49:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:49:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-31 08:49:40,677 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2018-01-31 08:49:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:40,678 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-31 08:49:40,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:49:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-31 08:49:40,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:49:40,679 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:40,680 INFO L351 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-31 08:49:40,680 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash -420007505, now seen corresponding path program 1 times [2018-01-31 08:49:40,680 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:40,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:40,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:40,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:40,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:40,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:41,376 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:49:41,844 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:49:41,997 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-31 08:49:41,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:41,997 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-31 08:49:42,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:42,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:42,064 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-31 08:49:42,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,084 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-31 08:49:42,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-31 08:49:42,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,101 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-31 08:49:42,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:49:42,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:49:42,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,519 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-31 08:49:42,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,549 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-31 08:49:42,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,560 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-31 08:49:42,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2018-01-31 08:49:42,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,823 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-31 08:49:42,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:42,850 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-31 08:49:42,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:42,863 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-31 08:49:42,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32 [2018-01-31 08:49:42,937 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-31 08:49:42,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:42,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-01-31 08:49:42,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:49:42,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:49:42,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=719, Unknown=1, NotChecked=0, Total=812 [2018-01-31 08:49:42,957 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 29 states. [2018-01-31 08:49:43,461 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-01-31 08:49:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:44,614 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-01-31 08:49:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:49:44,629 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-01-31 08:49:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:44,630 INFO L225 Difference]: With dead ends: 129 [2018-01-31 08:49:44,630 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:49:44,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=232, Invalid=1656, Unknown=4, NotChecked=0, Total=1892 [2018-01-31 08:49:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:49:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2018-01-31 08:49:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 08:49:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2018-01-31 08:49:44,643 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 56 [2018-01-31 08:49:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:44,644 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2018-01-31 08:49:44,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:49:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2018-01-31 08:49:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:49:44,644 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:44,645 INFO L351 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-31 08:49:44,645 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1175021715, now seen corresponding path program 1 times [2018-01-31 08:49:44,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:44,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:44,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:44,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:44,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:44,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:49:44,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:44,858 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-31 08:49:44,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:44,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:45,046 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-31 08:49:45,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:45,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2018-01-31 08:49:45,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:49:45,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:49:45,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:49:45,066 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand 19 states. [2018-01-31 08:49:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:45,507 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2018-01-31 08:49:45,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:49:45,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-01-31 08:49:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:45,508 INFO L225 Difference]: With dead ends: 126 [2018-01-31 08:49:45,509 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:49:45,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:49:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:49:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 88. [2018-01-31 08:49:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:49:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2018-01-31 08:49:45,524 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 58 [2018-01-31 08:49:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:45,524 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2018-01-31 08:49:45,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:49:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2018-01-31 08:49:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:49:45,525 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:45,526 INFO L351 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-31 08:49:45,526 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2065934786, now seen corresponding path program 1 times [2018-01-31 08:49:45,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:45,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:45,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:45,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:45,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:45,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:46,183 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-31 08:49:46,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:46,184 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-31 08:49:46,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:46,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:46,259 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-31 08:49:46,269 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-31 08:49:46,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:46,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:46,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:46,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-01-31 08:49:46,448 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-31 08:49:46,450 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:49:46,450 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-31 08:49:46,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:46,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:46,457 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-31 08:49:46,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-31 08:49:46,462 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-31 08:49:46,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:46,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2018-01-31 08:49:46,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:49:46,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:49:46,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:49:46,483 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 24 states. [2018-01-31 08:49:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:46,957 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-01-31 08:49:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:49:46,957 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-01-31 08:49:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:46,958 INFO L225 Difference]: With dead ends: 127 [2018-01-31 08:49:46,958 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:49:46,959 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:49:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:49:46,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2018-01-31 08:49:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 08:49:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2018-01-31 08:49:46,973 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 59 [2018-01-31 08:49:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:46,973 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2018-01-31 08:49:46,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:49:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2018-01-31 08:49:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:49:46,974 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:46,974 INFO L351 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-31 08:49:46,974 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:46,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2065934785, now seen corresponding path program 1 times [2018-01-31 08:49:46,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:46,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:46,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:46,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:46,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:46,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:47,431 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-31 08:49:47,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:47,432 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-31 08:49:47,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:47,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:47,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:49:47,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:49:47,599 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-31 08:49:47,601 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-31 08:49:47,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,606 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-31 08:49:47,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-31 08:49:47,711 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-31 08:49:47,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,718 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-31 08:49:47,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3 [2018-01-31 08:49:47,813 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-31 08:49:47,814 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:49:47,815 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-31 08:49:47,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:47,822 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-31 08:49:47,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5 [2018-01-31 08:49:47,826 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-31 08:49:47,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:47,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2018-01-31 08:49:47,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:49:47,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:49:47,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:49:47,847 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand 26 states. [2018-01-31 08:49:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:48,392 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2018-01-31 08:49:48,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:49:48,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-01-31 08:49:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:48,393 INFO L225 Difference]: With dead ends: 103 [2018-01-31 08:49:48,393 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 08:49:48,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:49:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 08:49:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-01-31 08:49:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 08:49:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-01-31 08:49:48,404 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 59 [2018-01-31 08:49:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:48,405 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-01-31 08:49:48,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:49:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-01-31 08:49:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:49:48,406 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:48,406 INFO L351 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-31 08:49:48,406 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:48,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1089853339, now seen corresponding path program 1 times [2018-01-31 08:49:48,406 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:48,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:48,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:48,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:48,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:48,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:48,461 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-31 08:49:48,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:48,461 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-31 08:49:48,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:48,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:48,577 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-31 08:49:48,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:49:48,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-01-31 08:49:48,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:49:48,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:49:48,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:49:48,598 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 8 states. [2018-01-31 08:49:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:48,665 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-31 08:49:48,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:49:48,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-01-31 08:49:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:48,666 INFO L225 Difference]: With dead ends: 105 [2018-01-31 08:49:48,666 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:49:48,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:49:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:49:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-31 08:49:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 08:49:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-31 08:49:48,677 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 61 [2018-01-31 08:49:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:48,678 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-31 08:49:48,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:49:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-31 08:49:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-31 08:49:48,679 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:48,679 INFO L351 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] [2018-01-31 08:49:48,679 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1434342132, now seen corresponding path program 2 times [2018-01-31 08:49:48,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:48,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:48,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:48,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:48,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:48,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:48,778 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-31 08:49:48,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:48,778 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-31 08:49:48,783 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:49:48,799 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:49:48,815 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:49:48,816 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:49:48,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:48,877 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-31 08:49:48,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:48,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-31 08:49:48,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:49:48,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:49:48,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:49:48,897 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 13 states. [2018-01-31 08:49:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:49,448 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-01-31 08:49:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:49:49,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-01-31 08:49:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:49,449 INFO L225 Difference]: With dead ends: 156 [2018-01-31 08:49:49,450 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 08:49:49,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:49:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 08:49:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 105. [2018-01-31 08:49:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-31 08:49:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-31 08:49:49,464 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 64 [2018-01-31 08:49:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:49,464 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-31 08:49:49,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:49:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-31 08:49:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:49:49,465 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:49,466 INFO L351 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-31 08:49:49,466 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:49:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash -123263374, now seen corresponding path program 1 times [2018-01-31 08:49:49,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:49,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:49,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:49,467 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:49:49,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:49,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:49:50,364 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-31 08:49:50,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:50,396 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-31 08:49:50,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:50,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:50,437 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-31 08:49:50,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:50,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:50,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:49:50,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:50,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:50,518 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-31 08:49:50,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:50,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:50,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:49:50,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 08:49:50,601 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-31 08:49:50,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:50,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:50,744 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-31 08:49:50,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-31 08:49:51,186 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-31 08:49:51,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:51,190 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-31 08:49:51,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:19 [2018-01-31 08:49:55,212 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-31 08:49:55,584 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-31 08:49:55,589 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:49:55,596 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-31 08:49:55,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:55,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:49:55,606 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-31 08:49:55,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:10 [2018-01-31 08:49:55,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:55,622 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-31 08:49:55,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:55,632 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-31 08:49:55,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-01-31 08:49:55,676 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-31 08:49:55,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:55,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2018-01-31 08:49:55,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-31 08:49:55,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-31 08:49:55,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=889, Unknown=1, NotChecked=0, Total=992 [2018-01-31 08:49:55,710 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 32 states. [2018-01-31 08:50:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:50:28,740 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-01-31 08:50:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:50:28,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-01-31 08:50:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:50:28,742 INFO L225 Difference]: With dead ends: 122 [2018-01-31 08:50:28,742 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:50:28,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=264, Invalid=1991, Unknown=1, NotChecked=0, Total=2256 [2018-01-31 08:50:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:50:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-31 08:50:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:50:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-31 08:50:28,755 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 66 [2018-01-31 08:50:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:50:28,756 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-31 08:50:28,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-31 08:50:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-31 08:50:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:50:28,756 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:50:28,756 INFO L351 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-31 08:50:28,756 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:50:28,757 INFO L82 PathProgramCache]: Analyzing trace with hash -123263326, now seen corresponding path program 1 times [2018-01-31 08:50:28,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:50:28,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:50:28,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:28,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:50:28,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:28,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:50:29,084 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-31 08:50:29,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:50:29,084 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-31 08:50:29,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:50:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:29,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:50:29,157 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-31 08:50:29,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:50:29,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:50:29,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:50:29,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:50:29,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:50:29,177 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2018-01-31 08:50:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:50:29,262 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-01-31 08:50:29,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:50:29,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-01-31 08:50:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:50:29,263 INFO L225 Difference]: With dead ends: 135 [2018-01-31 08:50:29,263 INFO L226 Difference]: Without dead ends: 116 [2018-01-31 08:50:29,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:50:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-31 08:50:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-01-31 08:50:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:50:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-01-31 08:50:29,277 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 66 [2018-01-31 08:50:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:50:29,278 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-01-31 08:50:29,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:50:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-01-31 08:50:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:50:29,279 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:50:29,279 INFO L351 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-31 08:50:29,279 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:50:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash 57889040, now seen corresponding path program 1 times [2018-01-31 08:50:29,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:50:29,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:50:29,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:29,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:50:29,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:29,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:50:29,973 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 20 DAG size of output 18 [2018-01-31 08:50:30,830 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-31 08:50:30,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:50:30,830 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-31 08:50:30,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:50:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:30,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:50:31,937 WARN L143 SmtUtils]: Spent 206ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-31 08:50:31,976 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-31 08:50:31,990 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-31 08:50:31,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:32,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:50:32,212 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-31 08:50:32,222 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-31 08:50:32,223 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:32,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:50:32,338 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-31 08:50:32,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117 [2018-01-31 08:50:33,014 WARN L143 SmtUtils]: Spent 431ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-31 08:50:33,031 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-31 08:50:33,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:33,125 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-31 08:50:33,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:33,141 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-31 08:50:33,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71 [2018-01-31 08:50:35,204 WARN L146 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 41 DAG size of output 23 [2018-01-31 08:50:41,606 WARN L146 SmtUtils]: Spent 4068ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-01-31 08:50:43,769 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 66 [2018-01-31 08:50:48,024 WARN L143 SmtUtils]: Spent 2059ms on a formula simplification that was a NOOP. DAG size: 67 [2018-01-31 08:50:48,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 102 [2018-01-31 08:50:48,075 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:50:48,076 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:50:48,076 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-31 08:50:48,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:48,134 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:50:48,135 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:50:48,142 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-31 08:50:48,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:50:48,213 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 75 treesize of output 63 [2018-01-31 08:50:48,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:48,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:50:48,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2018-01-31 08:50:48,278 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:50:48,278 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-31 08:50:48,278 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:48,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:50:48,318 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-31 08:50:48,318 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:182, output treesize:63 [2018-01-31 08:50:50,713 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-31 08:50:50,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:50:50,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 39 [2018-01-31 08:50:50,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 08:50:50,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 08:50:50,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1432, Unknown=32, NotChecked=0, Total=1560 [2018-01-31 08:50:50,743 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 40 states. [2018-01-31 08:50:51,146 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 23 DAG size of output 14 [2018-01-31 08:50:56,844 WARN L146 SmtUtils]: Spent 2069ms on a formula simplification. DAG size of input: 113 DAG size of output 44 [2018-01-31 08:50:59,042 WARN L146 SmtUtils]: Spent 2082ms on a formula simplification. DAG size of input: 113 DAG size of output 37 [2018-01-31 08:50:59,302 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 133 DAG size of output 45 [2018-01-31 08:51:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:51:08,539 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-01-31 08:51:08,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:51:08,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 69 [2018-01-31 08:51:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:51:08,540 INFO L225 Difference]: With dead ends: 116 [2018-01-31 08:51:08,540 INFO L226 Difference]: Without dead ends: 93 [2018-01-31 08:51:08,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=279, Invalid=3316, Unknown=65, NotChecked=0, Total=3660 [2018-01-31 08:51:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-31 08:51:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-31 08:51:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-31 08:51:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-31 08:51:08,549 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 69 [2018-01-31 08:51:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:51:08,550 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-31 08:51:08,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 08:51:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-31 08:51:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 08:51:08,551 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:51:08,551 INFO L351 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-31 08:51:08,551 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:51:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash 581785866, now seen corresponding path program 2 times [2018-01-31 08:51:08,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:51:08,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:51:08,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:08,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:51:08,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:51:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:51:08,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:51:09,244 WARN L146 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:51:09,422 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 20 DAG size of output 18 [2018-01-31 08:51:09,676 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-31 08:51:09,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:51:09,677 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:51:09,683 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:51:09,697 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:51:09,707 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:51:09,711 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:51:09,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:51:09,732 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-31 08:51:09,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:09,748 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-31 08:51:09,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:09,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:51:09,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:09,765 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-31 08:51:09,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:09,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:51:09,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:51:10,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:10,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:10,172 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-31 08:51:10,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:10,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:10,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:10,214 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 47 treesize of output 41 [2018-01-31 08:51:10,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:10,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:10,352 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-31 08:51:10,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:10,400 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 39 treesize of output 38 [2018-01-31 08:51:10,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:10,454 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-31 08:51:10,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:51:10,862 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 57 DAG size of output 54 [2018-01-31 08:51:11,053 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 54 [2018-01-31 08:51:11,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,284 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-31 08:51:11,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:11,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,490 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 61 treesize of output 55 [2018-01-31 08:51:11,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:11,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,666 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-31 08:51:11,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:11,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,670 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-31 08:51:11,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:11,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:11,842 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 55 treesize of output 82 [2018-01-31 08:51:11,843 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:12,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,094 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 63 treesize of output 57 [2018-01-31 08:51:12,095 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:12,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,295 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-31 08:51:12,295 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:12,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,521 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-31 08:51:12,522 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:12,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:12,779 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 57 treesize of output 80 [2018-01-31 08:51:12,779 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:13,064 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-31 08:51:13,064 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-31 08:51:14,428 WARN L146 SmtUtils]: Spent 483ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-31 08:51:14,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:14,994 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-31 08:51:14,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:15,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,218 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-31 08:51:15,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:15,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,222 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-31 08:51:15,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:15,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,400 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,410 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-31 08:51:15,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:15,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,678 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-31 08:51:15,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:15,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,684 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-31 08:51:15,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:15,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:15,912 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-31 08:51:15,913 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:16,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,289 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-31 08:51:16,290 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-31 08:51:16,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,685 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-31 08:51:16,686 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:16,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,689 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-31 08:51:16,690 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:16,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,954 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-31 08:51:16,954 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:16,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:51:16,958 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-31 08:51:16,958 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-31 08:51:17,213 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-31 08:51:17,213 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 28 variables, input treesize:245, output treesize:357 [2018-01-31 08:51:17,761 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 200 DAG size of output 51 [2018-01-31 08:51:17,796 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-31 08:51:17,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:51:17,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-31 08:51:17,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-31 08:51:17,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-31 08:51:17,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1011, Unknown=1, NotChecked=0, Total=1122 [2018-01-31 08:51:17,816 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 34 states. [2018-01-31 08:51:18,084 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 55 DAG size of output 52 Received shutdown request... [2018-01-31 08:51:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:51:18,159 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:51:18,163 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:51:18,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:51:18 BoogieIcfgContainer [2018-01-31 08:51:18,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:51:18,164 INFO L168 Benchmark]: Toolchain (without parser) took 154180.69 ms. Allocated memory was 309.3 MB in the beginning and 565.7 MB in the end (delta: 256.4 MB). Free memory was 268.1 MB in the beginning and 412.9 MB in the end (delta: -144.8 MB). Peak memory consumption was 111.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:18,165 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:51:18,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.98 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 255.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:18,165 INFO L168 Benchmark]: Boogie Preprocessor took 38.40 ms. Allocated memory is still 309.3 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:18,165 INFO L168 Benchmark]: RCFGBuilder took 512.87 ms. Allocated memory is still 309.3 MB. Free memory was 253.1 MB in the beginning and 234.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:18,166 INFO L168 Benchmark]: TraceAbstraction took 153281.37 ms. Allocated memory was 309.3 MB in the beginning and 565.7 MB in the end (delta: 256.4 MB). Free memory was 234.1 MB in the beginning and 412.9 MB in the end (delta: -178.8 MB). Peak memory consumption was 77.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:18,167 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.11 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 332.98 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 255.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.40 ms. Allocated memory is still 309.3 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 512.87 ms. Allocated memory is still 309.3 MB. Free memory was 253.1 MB in the beginning and 234.1 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153281.37 ms. Allocated memory was 309.3 MB in the beginning and 565.7 MB in the end (delta: 256.4 MB). Free memory was 234.1 MB in the beginning and 412.9 MB in the end (delta: -178.8 MB). Peak memory consumption was 77.6 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 (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (93states) and interpolant automaton (currently 7 states, 34 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 9 error locations. TIMEOUT Result, 153.2s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 105.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1123 SDtfs, 1810 SDslu, 7491 SDs, 0 SdLazy, 5289 SolverSat, 275 SolverUnsat, 93 SolverUnknown, 0 SolverNotchecked, 85.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 755 SyntacticMatches, 32 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2955 ImplicationChecksByTransitivity, 55.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 313 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 45.9s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1830 ConstructedInterpolants, 195 QuantifiedInterpolants, 1186151 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2370 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 414/726 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_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-51-18-175.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-51-18-175.csv Completed graceful shutdown