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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:35:06,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:35:06,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:35:06,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:35:06,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:35:06,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:35:06,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:35:06,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:35:06,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:35:06,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:35:06,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:35:06,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:35:06,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:35:06,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:35:06,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:35:06,813 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:35:06,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:35:06,818 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:35:06,819 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:35:06,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:35:06,823 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:35:06,823 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:35:06,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:35:06,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:35:06,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:35:06,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:35:06,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:35:06,828 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:35:06,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:35:06,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:35:06,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:35:06,830 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:35:06,863 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:35:06,863 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:35:06,864 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:35:06,864 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:35:06,865 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:35:06,865 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:35:06,865 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:35:06,865 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:35:06,865 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:35:06,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:35:06,866 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:35:06,866 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:35:06,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:35:06,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:35:06,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:35:06,869 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:35:06,869 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:35:06,870 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:35:06,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:35:06,870 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:35:06,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:35:06,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:35:06,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:35:06,871 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:35:06,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:35:06,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:35:06,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:35:06,872 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:35:06,873 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:35:06,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:35:06,874 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:35:06,874 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:35:06,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:35:06,875 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:35:06,875 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:35:06,876 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:35:06,876 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:35:06,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:35:06,935 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:35:06,939 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:35:06,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:35:06,942 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:35:06,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-25 03:35:07,190 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:35:07,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:35:07,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:35:07,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:35:07,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:35:07,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b331d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07, skipping insertion in model container [2018-01-25 03:35:07,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,251 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:35:07,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:35:07,554 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:35:07,594 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:35:07,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07 WrapperNode [2018-01-25 03:35:07,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:35:07,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:35:07,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:35:07,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:35:07,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (1/1) ... [2018-01-25 03:35:07,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:35:07,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:35:07,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:35:07,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:35:07,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (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-25 03:35:07,747 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:35:07,747 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:35:07,747 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:35:07,747 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:35:07,747 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:35:07,747 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:35:07,747 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:35:07,747 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:35:07,748 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:35:07,749 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:35:07,979 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:35:07,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:35:07 BoogieIcfgContainer [2018-01-25 03:35:07,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:35:07,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:35:07,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:35:07,982 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:35:07,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:35:07" (1/3) ... [2018-01-25 03:35:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ed7e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:35:07, skipping insertion in model container [2018-01-25 03:35:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:35:07" (2/3) ... [2018-01-25 03:35:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ed7e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:35:07, skipping insertion in model container [2018-01-25 03:35:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:35:07" (3/3) ... [2018-01-25 03:35:07,986 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-25 03:35:07,992 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:35:07,999 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 03:35:08,070 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:35:08,071 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:35:08,071 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:35:08,071 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:35:08,071 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:35:08,071 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:35:08,071 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:35:08,072 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:35:08,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:35:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 03:35:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:35:08,108 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:08,110 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:08,110 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-01-25 03:35:08,118 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:08,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:08,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:08,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:08,188 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:08,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:08,359 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-25 03:35:08,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:08,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:35:08,362 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:08,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:35:08,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:35:08,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:35:08,376 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 03:35:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:08,574 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-01-25 03:35:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:35:08,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 03:35:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:08,586 INFO L225 Difference]: With dead ends: 95 [2018-01-25 03:35:08,586 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 03:35:08,589 INFO L525 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-25 03:35:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 03:35:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-01-25 03:35:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 03:35:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-01-25 03:35:08,630 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-01-25 03:35:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:08,630 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-01-25 03:35:08,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:35:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-01-25 03:35:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:35:08,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:08,633 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:08,633 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:08,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-01-25 03:35:08,634 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:08,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:08,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:08,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:08,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:08,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:08,751 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-25 03:35:08,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:08,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:35:08,752 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:08,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:35:08,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:35:08,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:35:08,754 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-01-25 03:35:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:08,881 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-25 03:35:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:35:08,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:35:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:08,883 INFO L225 Difference]: With dead ends: 75 [2018-01-25 03:35:08,883 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 03:35:08,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:35:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 03:35:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-01-25 03:35:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 03:35:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 03:35:08,894 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-25 03:35:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:08,894 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 03:35:08,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:35:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 03:35:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:35:08,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:08,896 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:08,896 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-01-25 03:35:08,896 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:08,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:08,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:08,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:08,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:08,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:08,972 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-25 03:35:08,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:08,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:35:08,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:08,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:35:08,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:35:08,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:08,973 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-25 03:35:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,059 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-25 03:35:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:35:09,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:35:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,062 INFO L225 Difference]: With dead ends: 70 [2018-01-25 03:35:09,062 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 03:35:09,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 03:35:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-25 03:35:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 03:35:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-01-25 03:35:09,069 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-01-25 03:35:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,069 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-01-25 03:35:09,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:35:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-01-25 03:35:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:35:09,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,071 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-01-25 03:35:09,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:09,117 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-25 03:35:09,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:09,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:35:09,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:09,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:35:09,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:35:09,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,118 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-01-25 03:35:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,213 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-01-25 03:35:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:35:09,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:35:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,215 INFO L225 Difference]: With dead ends: 71 [2018-01-25 03:35:09,215 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 03:35:09,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 03:35:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-01-25 03:35:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 03:35:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-01-25 03:35:09,225 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-01-25 03:35:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,226 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-01-25 03:35:09,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:35:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-01-25 03:35:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:35:09,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,228 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,228 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-01-25 03:35:09,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:09,289 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-25 03:35:09,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:09,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:35:09,289 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:09,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:35:09,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:35:09,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,290 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-01-25 03:35:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,316 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-25 03:35:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:35:09,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:35:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,317 INFO L225 Difference]: With dead ends: 80 [2018-01-25 03:35:09,317 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 03:35:09,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 03:35:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 03:35:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 03:35:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-25 03:35:09,324 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-01-25 03:35:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,325 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-25 03:35:09,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:35:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-25 03:35:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:35:09,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,326 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,326 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-01-25 03:35:09,326 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,328 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:09,388 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-25 03:35:09,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:09,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:35:09,389 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:09,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:35:09,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:35:09,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:35:09,390 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-25 03:35:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,444 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 03:35:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:35:09,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 03:35:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,445 INFO L225 Difference]: With dead ends: 45 [2018-01-25 03:35:09,445 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:35:09,446 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:35:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:35:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 03:35:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 03:35:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 03:35:09,452 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-01-25 03:35:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,452 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 03:35:09,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:35:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 03:35:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:35:09,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,454 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-01-25 03:35:09,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:09,516 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-25 03:35:09,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:09,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:35:09,516 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:09,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:35:09,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:35:09,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:35:09,517 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-25 03:35:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,627 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 03:35:09,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:35:09,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 03:35:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,642 INFO L225 Difference]: With dead ends: 52 [2018-01-25 03:35:09,642 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 03:35:09,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:35:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 03:35:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-25 03:35:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:35:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-25 03:35:09,650 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-01-25 03:35:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,650 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-25 03:35:09,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:35:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-25 03:35:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:35:09,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,651 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,651 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-01-25 03:35:09,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:09,718 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-25 03:35:09,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:09,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:35:09,718 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:09,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:35:09,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:35:09,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:35:09,719 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-25 03:35:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,837 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-25 03:35:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:35:09,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 03:35:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,839 INFO L225 Difference]: With dead ends: 94 [2018-01-25 03:35:09,839 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 03:35:09,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:35:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 03:35:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-01-25 03:35:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 03:35:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-25 03:35:09,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-01-25 03:35:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,856 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-25 03:35:09,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:35:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-25 03:35:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:35:09,858 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,858 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,858 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-01-25 03:35:09,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:35:09,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:35:09,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:35:09,916 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:09,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:35:09,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:35:09,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,917 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-25 03:35:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:09,938 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-25 03:35:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:35:09,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 03:35:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:09,941 INFO L225 Difference]: With dead ends: 106 [2018-01-25 03:35:09,941 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 03:35:09,942 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:35:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 03:35:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-01-25 03:35:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 03:35:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 03:35:09,948 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-01-25 03:35:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:09,948 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 03:35:09,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:35:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 03:35:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:35:09,949 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:09,949 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:09,949 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-01-25 03:35:09,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:09,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:09,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:09,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:09,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:35:10,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:35:10,120 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:35:10,121 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 03:35:10,122 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [39], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-25 03:35:10,167 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:35:10,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:35:11,745 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 03:35:11,747 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 03:35:11,766 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 03:35:12,703 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 03:35:12,704 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 03:35:12,983 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 03:35:12,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:35:12,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-25 03:35:12,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:35:12,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 03:35:12,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 03:35:12,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:35:12,986 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 16 states. [2018-01-25 03:35:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:35:24,726 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-25 03:35:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 03:35:24,727 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-01-25 03:35:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:35:24,728 INFO L225 Difference]: With dead ends: 107 [2018-01-25 03:35:24,728 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 03:35:24,729 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:35:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 03:35:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2018-01-25 03:35:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 03:35:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-25 03:35:24,738 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2018-01-25 03:35:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:35:24,738 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-25 03:35:24,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 03:35:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-25 03:35:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:35:24,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:35:24,740 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:35:24,740 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:35:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-01-25 03:35:24,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:35:24,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:24,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:24,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:35:24,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:35:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:24,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:35:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:35:25,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:35:25,039 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:35:25,039 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 03:35:25,040 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [40], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-25 03:35:25,040 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:35:25,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:35:25,724 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:35:25,724 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 03:35:25,732 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:35:25,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:35:25,732 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 03:35:25,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:25,739 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:35:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:25,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:35:25,840 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-25 03:35:25,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:25,858 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-25 03:35:25,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:25,860 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-25 03:35:25,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:25,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-25 03:35:25,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:25,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:35:25,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 03:35:26,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:26,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:26,193 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-25 03:35:26,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:26,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:26,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:26,280 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-25 03:35:26,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:26,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:26,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:26,330 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-25 03:35:26,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:26,388 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-25 03:35:26,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:26,433 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-25 03:35:26,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 03:35:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:35:26,555 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:35:27,413 WARN L146 SmtUtils]: Spent 742ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-25 03:35:27,443 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 03:35:36,032 WARN L146 SmtUtils]: Spent 8477ms on a formula simplification. DAG size of input: 84 DAG size of output 36 [2018-01-25 03:35:36,067 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 03:35:40,738 WARN L146 SmtUtils]: Spent 4457ms on a formula simplification. DAG size of input: 83 DAG size of output 41 [2018-01-25 03:35:41,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:35:41,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:41,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-25 03:35:41,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-25 03:35:41,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:41,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:35:41,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:35:41,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:41,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:35:41,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 03:35:41,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 03:35:41,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:41,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 03:35:41,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:41,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 03:35:42,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 03:35:42,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:42,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:35:42,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 03:35:42,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 03:35:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:35:44,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:35:44,269 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:35:44,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:35:44,274 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:35:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:35:44,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:35:44,336 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-25 03:35:44,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,365 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-25 03:35:44,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,388 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-25 03:35:44,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,390 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-25 03:35:44,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:35:44,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 03:35:44,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:44,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:44,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-25 03:35:44,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:44,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-25 03:35:44,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:44,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:35:44,656 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-25 03:35:44,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,702 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-25 03:35:44,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:35:44,758 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-25 03:35:44,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 03:35:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:35:44,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:35:44,953 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 03:35:55,494 WARN L146 SmtUtils]: Spent 8127ms on a formula simplification. DAG size of input: 84 DAG size of output 36 [2018-01-25 03:35:55,511 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 03:35:59,786 WARN L146 SmtUtils]: Spent 2041ms on a formula simplification. DAG size of input: 83 DAG size of output 40 [2018-01-25 03:35:59,984 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 50 DAG size of output 42 [2018-01-25 03:35:59,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-25 03:36:00,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-25 03:36:00,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:36:00,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 03:36:00,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:36:00,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 03:36:00,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 03:36:00,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 03:36:00,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 03:36:00,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 03:36:00,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:36:00,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 03:36:00,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 03:36:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:36:00,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:36:00,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 11, 11] total 32 [2018-01-25 03:36:00,841 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:36:00,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 03:36:00,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 03:36:00,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=950, Unknown=4, NotChecked=0, Total=1056 [2018-01-25 03:36:00,843 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. Received shutdown request... [2018-01-25 03:36:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:36:01,272 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:36:01,285 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:36:01,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:36:01 BoogieIcfgContainer [2018-01-25 03:36:01,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:36:01,292 INFO L168 Benchmark]: Toolchain (without parser) took 54100.97 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 828.4 MB). Free memory was 262.5 MB in the beginning and 512.4 MB in the end (delta: -249.9 MB). Peak memory consumption was 578.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:36:01,293 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 305.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:36:01,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.64 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 248.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:36:01,294 INFO L168 Benchmark]: Boogie Preprocessor took 55.50 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:36:01,294 INFO L168 Benchmark]: RCFGBuilder took 321.06 ms. Allocated memory is still 305.1 MB. Free memory was 246.4 MB in the beginning and 229.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:36:01,301 INFO L168 Benchmark]: TraceAbstraction took 53304.79 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 828.4 MB). Free memory was 229.9 MB in the beginning and 512.4 MB in the end (delta: -282.5 MB). Peak memory consumption was 545.9 MB. Max. memory is 5.3 GB. [2018-01-25 03:36:01,303 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.23 ms. Allocated memory is still 305.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 402.64 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 248.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 55.50 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 246.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 321.06 ms. Allocated memory is still 305.1 MB. Free memory was 246.4 MB in the beginning and 229.9 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53304.79 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 828.4 MB). Free memory was 229.9 MB in the beginning and 512.4 MB in the end (delta: -282.5 MB). Peak memory consumption was 545.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 133 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.266124 RENAME_VARIABLES(MILLISECONDS) : 0.088253 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.226273 PROJECTAWAY(MILLISECONDS) : 0.054270 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.136597 DISJOIN(MILLISECONDS) : 0.660183 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.114792 ADD_EQUALITY(MILLISECONDS) : 0.016047 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015264 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.379132 RENAME_VARIABLES(MILLISECONDS) : 0.080718 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.147769 PROJECTAWAY(MILLISECONDS) : 0.063600 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.044228 DISJOIN(MILLISECONDS) : 0.571907 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.101885 ADD_EQUALITY(MILLISECONDS) : 0.016101 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007241 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 78 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (57states) and interpolant automaton (currently 6 states, 21 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 53.2s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 454 SDtfs, 414 SDslu, 1255 SDs, 0 SdLazy, 392 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 206 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 33.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 131 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 341 ConstructedInterpolants, 54 QuantifiedInterpolants, 115845 SizeOfPredicates, 18 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 13/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-36-01-315.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-36-01-315.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-36-01-315.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_03-36-01-315.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_03-36-01-315.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-36-01-315.csv Completed graceful shutdown