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_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:48:52,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:48:52,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:48:52,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:48:52,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:48:52,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:48:52,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:48:52,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:48:52,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:48:52,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:48:52,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:48:52,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:48:52,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:48:52,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:48:52,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:48:52,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:48:52,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:48:52,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:48:52,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:48:52,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:48:52,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:48:52,829 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:48:52,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:48:52,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:48:52,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:48:52,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:48:52,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:48:52,835 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:48:52,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:48:52,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:48:52,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:48:52,837 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:52,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:48:52,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:48:52,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:48:52,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:48:52,853 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:48:52,853 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:48:52,853 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:48:52,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:48:52,856 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:48:52,856 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:48:52,856 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:48:52,856 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:48:52,856 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:48:52,856 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:48:52,857 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:48:52,857 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:48:52,857 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:48:52,857 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:48:52,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:48:52,857 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:48:52,858 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:48:52,858 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:48:52,858 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:48:52,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:48:52,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:48:52,858 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:48:52,859 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:48:52,859 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:48:52,860 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:48:52,860 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:48:52,860 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:48:52,860 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:48:52,861 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:48:52,862 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:48:52,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:48:52,921 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:48:52,925 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:48:52,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:48:52,927 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:48:52,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-31 08:48:53,155 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:48:53,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:48:53,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:48:53,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:48:53,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:48:53,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:48:53" (1/1) ... [2018-01-31 08:48:53,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7817b408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:53, skipping insertion in model container [2018-01-31 08:48:53,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:48:53" (1/1) ... [2018-01-31 08:48:53,195 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:48:53,271 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:48:53,427 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:48:53,459 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:48:53,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:53 WrapperNode [2018-01-31 08:48:53,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:48:53,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:48:53,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:48:53,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:48:53,489 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:53" (1/1) ... [2018-01-31 08:48:53,489 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:53" (1/1) ... [2018-01-31 08:48:53,500 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:53" (1/1) ... [2018-01-31 08:48:53,501 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:53" (1/1) ... [2018-01-31 08:48:53,508 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:53" (1/1) ... [2018-01-31 08:48:53,515 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:53" (1/1) ... [2018-01-31 08:48:53,516 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:53" (1/1) ... [2018-01-31 08:48:53,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:48:53,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:48:53,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:48:53,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:48:53,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:53" (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:53,597 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:48:53,598 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:48:53,598 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:48:53,598 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:48:53,598 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:48:53,598 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:48:53,598 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:48:53,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:48:53,599 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:48:53,599 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:48:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:48:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:48:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:48:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:48:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:48:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:48:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:48:54,038 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:48:54,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:48:54 BoogieIcfgContainer [2018-01-31 08:48:54,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:48:54,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:48:54,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:48:54,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:48:54,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:48:53" (1/3) ... [2018-01-31 08:48:54,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133f7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:48:54, skipping insertion in model container [2018-01-31 08:48:54,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:48:53" (2/3) ... [2018-01-31 08:48:54,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133f7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:48:54, skipping insertion in model container [2018-01-31 08:48:54,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:48:54" (3/3) ... [2018-01-31 08:48:54,047 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-31 08:48:54,055 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:48:54,065 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-31 08:48:54,115 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:48:54,116 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:48:54,116 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:48:54,116 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:48:54,116 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:48:54,116 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:48:54,116 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:48:54,117 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:48:54,119 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:48:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-01-31 08:48:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:48:54,148 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:54,149 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] [2018-01-31 08:48:54,149 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash 684105477, now seen corresponding path program 1 times [2018-01-31 08:48:54,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:54,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:54,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:54,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:54,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:54,304 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:54,489 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:54,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:54,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:48:54,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:48:54,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:48:54,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:48:54,512 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-01-31 08:48:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:54,763 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-31 08:48:54,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:48:54,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-31 08:48:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:54,775 INFO L225 Difference]: With dead ends: 70 [2018-01-31 08:48:54,776 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 08:48:54,779 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:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 08:48:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-01-31 08:48:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 08:48:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-31 08:48:54,822 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 24 [2018-01-31 08:48:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:54,822 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-31 08:48:54,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:48:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-31 08:48:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:48:54,824 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:54,825 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:54,825 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash -380665648, now seen corresponding path program 1 times [2018-01-31 08:48:54,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:54,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:54,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:54,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:54,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:54,849 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:55,018 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:55,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:55,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:48:55,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:48:55,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:48:55,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:48:55,021 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-31 08:48:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:55,438 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-01-31 08:48:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:48:55,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:48:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:55,441 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:48:55,441 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 08:48:55,442 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:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 08:48:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2018-01-31 08:48:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 08:48:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-31 08:48:55,458 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 25 [2018-01-31 08:48:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:55,459 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-31 08:48:55,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:48:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-31 08:48:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 08:48:55,460 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:55,461 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] [2018-01-31 08:48:55,461 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:55,461 INFO L82 PathProgramCache]: Analyzing trace with hash -737007156, now seen corresponding path program 1 times [2018-01-31 08:48:55,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:55,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:55,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:55,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:55,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:55,485 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:55,568 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:55,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:55,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:48:55,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:48:55,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:48:55,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:48:55,569 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 4 states. [2018-01-31 08:48:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:55,679 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-01-31 08:48:55,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:48:55,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-31 08:48:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:55,681 INFO L225 Difference]: With dead ends: 77 [2018-01-31 08:48:55,681 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 08:48:55,682 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:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 08:48:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-31 08:48:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:48:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-31 08:48:55,695 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 27 [2018-01-31 08:48:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:55,696 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-31 08:48:55,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:48:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-31 08:48:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:48:55,697 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:55,698 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] [2018-01-31 08:48:55,698 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash 532330910, now seen corresponding path program 1 times [2018-01-31 08:48:55,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:55,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:55,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:55,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:55,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:55,712 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:55,816 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:55,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:55,816 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:55,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:55,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:55,922 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:55,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:48:55,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-31 08:48:55,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:48:55,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:48:55,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:48:55,952 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 5 states. [2018-01-31 08:48:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:56,007 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-01-31 08:48:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:48:56,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 08:48:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:56,010 INFO L225 Difference]: With dead ends: 84 [2018-01-31 08:48:56,010 INFO L226 Difference]: Without dead ends: 43 [2018-01-31 08:48:56,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:48:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-31 08:48:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-31 08:48:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-31 08:48:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-01-31 08:48:56,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 34 [2018-01-31 08:48:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:56,019 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-01-31 08:48:56,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:48:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-01-31 08:48:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:48:56,021 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:56,021 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] [2018-01-31 08:48:56,021 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:56,021 INFO L82 PathProgramCache]: Analyzing trace with hash -390587991, now seen corresponding path program 1 times [2018-01-31 08:48:56,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:56,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:56,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:56,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:56,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:56,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:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:48:56,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:56,172 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:56,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:56,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:56,278 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:56,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:56,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:48:56,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:48:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:48:56,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:56,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-31 08:48:56,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:48:56,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:48:56,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:48:56,371 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 7 states. [2018-01-31 08:48:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:56,617 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-31 08:48:56,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:48:56,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-31 08:48:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:56,619 INFO L225 Difference]: With dead ends: 48 [2018-01-31 08:48:56,619 INFO L226 Difference]: Without dead ends: 47 [2018-01-31 08:48:56,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:48:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-31 08:48:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-01-31 08:48:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-31 08:48:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-31 08:48:56,626 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 35 [2018-01-31 08:48:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:56,627 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-31 08:48:56,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:48:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-31 08:48:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:48:56,628 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:56,629 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] [2018-01-31 08:48:56,629 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash -390587990, now seen corresponding path program 1 times [2018-01-31 08:48:56,629 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:56,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:56,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:56,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:56,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:56,663 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:57,018 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:48:57,327 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-31 08:48:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:48:57,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:57,599 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:57,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:57,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:57,767 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 20 treesize of output 19 [2018-01-31 08:48:57,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:57,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:48:57,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:57,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:48:57,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:48:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:48:58,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:58,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-01-31 08:48:58,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:48:58,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:48:58,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:48:58,269 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 16 states. [2018-01-31 08:48:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:58,976 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-01-31 08:48:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:48:58,978 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-01-31 08:48:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:58,980 INFO L225 Difference]: With dead ends: 65 [2018-01-31 08:48:58,980 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 08:48:58,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:48:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 08:48:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-01-31 08:48:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-31 08:48:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-31 08:48:58,993 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 35 [2018-01-31 08:48:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:58,993 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-31 08:48:58,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:48:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-31 08:48:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:48:58,995 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:58,995 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] [2018-01-31 08:48:58,995 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1618317978, now seen corresponding path program 1 times [2018-01-31 08:48:58,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:58,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:58,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:58,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:58,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:59,021 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:59,210 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:59,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:59,210 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:48:59,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:59,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:59,243 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:59,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:59,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:48:59,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:48:59,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:59,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:59,296 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:59,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:59,343 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:59,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:48:59,359 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:59,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:59,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:48:59,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:48:59,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:48:59,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:48:59,382 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-31 08:48:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:59,966 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-01-31 08:48:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:48:59,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-01-31 08:48:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:59,968 INFO L225 Difference]: With dead ends: 64 [2018-01-31 08:48:59,968 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 08:48:59,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:48:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 08:48:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2018-01-31 08:48:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-31 08:48:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-31 08:48:59,977 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2018-01-31 08:48:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:59,978 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-31 08:48:59,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:48:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-31 08:48:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:48:59,980 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:59,980 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] [2018-01-31 08:48:59,980 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:48:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1618317979, now seen corresponding path program 1 times [2018-01-31 08:48:59,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:59,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:59,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:59,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:59,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:00,002 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:00,539 WARN L146 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 18 DAG size of output 14 [2018-01-31 08:49:01,098 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:49:01,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:01,098 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:01,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:01,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:01,170 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:01,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,234 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:01,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,237 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:01,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,253 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:01,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:49:01,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:49:01,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:01,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:01,835 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 54 treesize of output 67 [2018-01-31 08:49:01,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:01,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:01,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-31 08:49:01,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:01,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:01,929 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 45 treesize of output 39 [2018-01-31 08:49:01,929 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:01,976 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:49:01,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:02,008 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:49:02,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:49:02,126 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:49:02,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:02,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-31 08:49:02,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:49:02,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:49:02,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-31 08:49:02,155 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 21 states. [2018-01-31 08:49:02,520 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:49:27,451 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 58 DAG size of output 48 [2018-01-31 08:49:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:27,912 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-01-31 08:49:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:49:27,912 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-01-31 08:49:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:27,914 INFO L225 Difference]: With dead ends: 80 [2018-01-31 08:49:27,914 INFO L226 Difference]: Without dead ends: 79 [2018-01-31 08:49:27,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=146, Invalid=842, Unknown=4, NotChecked=0, Total=992 [2018-01-31 08:49:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-31 08:49:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2018-01-31 08:49:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-31 08:49:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-31 08:49:27,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 36 [2018-01-31 08:49:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:27,925 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-31 08:49:27,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:49:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-31 08:49:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:49:27,926 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:27,927 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:49:27,927 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:49:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash -7831485, now seen corresponding path program 1 times [2018-01-31 08:49:27,927 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:27,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:27,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:27,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:27,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:27,945 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:28,018 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:49:28,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:28,018 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:28,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:28,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:28,131 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:49:28,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:28,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-01-31 08:49:28,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:49:28,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:49:28,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:49:28,152 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2018-01-31 08:49:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:28,254 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-31 08:49:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:49:28,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-01-31 08:49:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:28,255 INFO L225 Difference]: With dead ends: 62 [2018-01-31 08:49:28,255 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 08:49:28,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:49:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 08:49:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-31 08:49:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-31 08:49:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-31 08:49:28,267 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 43 [2018-01-31 08:49:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:28,268 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-31 08:49:28,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:49:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-31 08:49:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:49:28,269 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:28,269 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:49:28,270 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:49:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 659032353, now seen corresponding path program 1 times [2018-01-31 08:49:28,270 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:28,270 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:28,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:28,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:28,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:28,287 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:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:49:28,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:28,812 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:28,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:28,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:28,869 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 17 treesize of output 16 [2018-01-31 08:49:28,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:28,918 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 20 treesize of output 19 [2018-01-31 08:49:28,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:28,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:49:28,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:49:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:49:29,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:29,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-31 08:49:29,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:49:29,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:49:29,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:49:29,804 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 22 states. [2018-01-31 08:49:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:49:30,382 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-01-31 08:49:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:49:30,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-01-31 08:49:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:49:30,383 INFO L225 Difference]: With dead ends: 78 [2018-01-31 08:49:30,383 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 08:49:30,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:49:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 08:49:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2018-01-31 08:49:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 08:49:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-31 08:49:30,404 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 51 [2018-01-31 08:49:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:49:30,406 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-31 08:49:30,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:49:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-31 08:49:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 08:49:30,407 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:49:30,407 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] [2018-01-31 08:49:30,407 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:49:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash 352288786, now seen corresponding path program 2 times [2018-01-31 08:49:30,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:49:30,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:49:30,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:30,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:49:30,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:49:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:49:30,433 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:30,904 WARN L146 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:49:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:49:31,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:49:31,095 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:31,100 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:49:31,111 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:49:31,118 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:49:31,122 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:49:31,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:49:31,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-31 08:49:31,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:49:31,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,183 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:31,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,184 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:31,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:49:31,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:49:31,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:31,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:31,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-31 08:49:31,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:31,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:31,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-31 08:49:31,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,548 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:49:31,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:31,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:49:31,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-31 08:49:31,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:49:31,638 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:49:31,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:49:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:49:34,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:49:34,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-31 08:49:34,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:49:34,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:49:34,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=581, Unknown=1, NotChecked=0, Total=650 [2018-01-31 08:49:34,272 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 26 states. [2018-01-31 08:49:34,627 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:50:26,244 WARN L146 SmtUtils]: Spent 2146ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-31 08:50:26,426 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-31 08:50:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:50:39,446 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-01-31 08:50:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:50:39,447 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-01-31 08:50:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:50:39,448 INFO L225 Difference]: With dead ends: 99 [2018-01-31 08:50:39,448 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:50:39,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=226, Invalid=1568, Unknown=12, NotChecked=0, Total=1806 [2018-01-31 08:50:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:50:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-01-31 08:50:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 08:50:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-31 08:50:39,460 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 52 [2018-01-31 08:50:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:50:39,460 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-31 08:50:39,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:50:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-31 08:50:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:50:39,461 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:50:39,462 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-01-31 08:50:39,462 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:50:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash 243861690, now seen corresponding path program 2 times [2018-01-31 08:50:39,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:50:39,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:50:39,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:39,463 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:50:39,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:39,476 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:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 08:50:39,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:50:39,653 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:50:39,662 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:50:39,673 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:50:39,679 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:50:39,681 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:50:39,683 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:50:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-31 08:50:39,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:50:39,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-31 08:50:39,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:50:39,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:50:39,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:50:39,760 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 13 states. [2018-01-31 08:50:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:50:39,927 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-01-31 08:50:39,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:50:39,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-01-31 08:50:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:50:39,928 INFO L225 Difference]: With dead ends: 71 [2018-01-31 08:50:39,928 INFO L226 Difference]: Without dead ends: 67 [2018-01-31 08:50:39,929 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:50:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-31 08:50:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-01-31 08:50:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-31 08:50:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-31 08:50:39,942 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 59 [2018-01-31 08:50:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:50:39,943 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-31 08:50:39,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:50:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-31 08:50:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-31 08:50:39,944 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:50:39,944 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1] [2018-01-31 08:50:39,944 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:50:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2098211480, now seen corresponding path program 3 times [2018-01-31 08:50:39,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:50:39,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:50:39,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:39,946 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:50:39,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:39,964 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:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-31 08:50:40,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:50:40,448 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:50:40,454 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:50:40,469 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:50:40,473 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:50:40,477 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:50:40,481 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:50:40,483 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:50:40,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:50:40,515 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 17 treesize of output 16 [2018-01-31 08:50:40,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:40,528 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 20 treesize of output 19 [2018-01-31 08:50:40,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:40,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:50:40,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:50:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-31 08:50:42,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:50:42,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-01-31 08:50:42,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:50:42,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:50:42,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:50:42,253 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 27 states. [2018-01-31 08:50:43,372 WARN L143 SmtUtils]: Spent 140ms on a formula simplification that was a NOOP. DAG size: 23 [2018-01-31 08:50:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:50:43,600 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2018-01-31 08:50:43,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:50:43,600 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2018-01-31 08:50:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:50:43,601 INFO L225 Difference]: With dead ends: 96 [2018-01-31 08:50:43,602 INFO L226 Difference]: Without dead ends: 95 [2018-01-31 08:50:43,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:50:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-31 08:50:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2018-01-31 08:50:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 08:50:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-31 08:50:43,625 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 67 [2018-01-31 08:50:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:50:43,626 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-31 08:50:43,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:50:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-31 08:50:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:50:43,627 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:50:43,628 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2018-01-31 08:50:43,628 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-31 08:50:43,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1493540745, now seen corresponding path program 4 times [2018-01-31 08:50:43,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:50:43,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:50:43,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:43,629 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:50:43,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:50:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:50:43,644 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:44,490 WARN L146 SmtUtils]: Spent 573ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:50:44,730 WARN L143 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 22 [2018-01-31 08:50:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:50:44,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:50:44,973 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:50:44,979 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:50:45,002 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:50:45,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:50:45,025 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:50:45,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,041 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:50:45,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,043 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:50:45,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,060 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:50:45,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:50:45,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:50:45,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,345 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 54 treesize of output 67 [2018-01-31 08:50:45,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:50:45,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-31 08:50:45,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:50:45,497 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:50:45,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:50:45,555 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:50:45,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:50:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:50:46,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:50:46,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2018-01-31 08:50:46,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:50:46,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:50:46,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=836, Unknown=1, NotChecked=0, Total=930 [2018-01-31 08:50:46,399 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 31 states. [2018-01-31 08:50:46,796 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:50:47,064 WARN L143 SmtUtils]: Spent 223ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-31 08:50:47,732 WARN L143 SmtUtils]: Spent 281ms on a formula simplification that was a NOOP. DAG size: 58 Received shutdown request... [2018-01-31 08:51:32,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:51:32,721 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:51:32,725 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:51:32,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:51:32 BoogieIcfgContainer [2018-01-31 08:51:32,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:51:32,726 INFO L168 Benchmark]: Toolchain (without parser) took 159571.09 ms. Allocated memory was 307.2 MB in the beginning and 521.1 MB in the end (delta: 213.9 MB). Free memory was 266.0 MB in the beginning and 490.3 MB in the end (delta: -224.4 MB). Peak memory consumption was 174.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:32,727 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:51:32,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.75 ms. Allocated memory is still 307.2 MB. Free memory was 266.0 MB in the beginning and 252.9 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:32,728 INFO L168 Benchmark]: Boogie Preprocessor took 51.63 ms. Allocated memory is still 307.2 MB. Free memory was 252.9 MB in the beginning and 250.9 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:32,728 INFO L168 Benchmark]: RCFGBuilder took 514.48 ms. Allocated memory is still 307.2 MB. Free memory was 250.9 MB in the beginning and 234.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:32,728 INFO L168 Benchmark]: TraceAbstraction took 158685.53 ms. Allocated memory was 307.2 MB in the beginning and 521.1 MB in the end (delta: 213.9 MB). Free memory was 234.9 MB in the beginning and 490.3 MB in the end (delta: -255.4 MB). Peak memory consumption was 143.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:51:32,730 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.97 ms. Allocated memory is still 307.2 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 306.75 ms. Allocated memory is still 307.2 MB. Free memory was 266.0 MB in the beginning and 252.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.63 ms. Allocated memory is still 307.2 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 514.48 ms. Allocated memory is still 307.2 MB. Free memory was 250.9 MB in the beginning and 234.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 158685.53 ms. Allocated memory was 307.2 MB in the beginning and 521.1 MB in the end (delta: 213.9 MB). Free memory was 234.9 MB in the beginning and 490.3 MB in the end (delta: -255.4 MB). Peak memory consumption was 143.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (81states) and interpolant automaton (currently 15 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 42 locations, 3 error locations. TIMEOUT Result, 158.6s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 141.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 518 SDtfs, 1083 SDslu, 2848 SDs, 0 SdLazy, 3129 SolverSat, 248 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 90.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 746 GetRequests, 466 SyntacticMatches, 18 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 59.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 181 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1083 ConstructedInterpolants, 135 QuantifiedInterpolants, 646264 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1505 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 173/460 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_3_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-32-742.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_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-32-742.csv Completed graceful shutdown