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_smtcomp.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 06:09:33,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:09:33,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:09:33,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:09:33,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:09:33,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:09:33,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:09:33,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:09:33,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:09:33,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:09:33,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:09:33,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:09:33,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:09:33,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:09:33,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:09:33,848 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:09:33,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:09:33,852 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:09:33,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:09:33,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:09:33,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:09:33,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:09:33,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:09:33,859 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:09:33,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:09:33,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:09:33,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:09:33,862 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:09:33,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:09:33,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:09:33,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:09:33,863 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_smtcomp.epf [2018-01-25 06:09:33,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:09:33,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:09:33,872 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:09:33,873 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:09:33,873 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:09:33,873 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:09:33,873 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:09:33,873 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:09:33,874 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:09:33,874 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:09:33,874 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:09:33,874 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:09:33,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:09:33,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:09:33,874 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:09:33,875 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:09:33,875 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:09:33,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:09:33,875 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:09:33,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:09:33,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:09:33,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:09:33,876 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:09:33,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:09:33,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:09:33,876 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:09:33,876 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:09:33,877 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:09:33,878 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:09:33,878 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:09:33,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:09:33,920 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:09:33,923 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:09:33,925 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:09:33,925 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:09:33,925 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 06:09:34,115 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:09:34,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:09:34,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:09:34,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:09:34,126 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:09:34,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34, skipping insertion in model container [2018-01-25 06:09:34,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,144 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:09:34,192 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:09:34,309 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:09:34,328 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:09:34,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34 WrapperNode [2018-01-25 06:09:34,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:09:34,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:09:34,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:09:34,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:09:34,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (1/1) ... [2018-01-25 06:09:34,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:09:34,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:09:34,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:09:34,371 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:09:34,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (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 06:09:34,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:09:34,417 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:09:34,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:09:34,418 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:09:34,418 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:09:34,418 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:09:34,419 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:09:34,419 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:09:34,419 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:09:34,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:09:34,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:09:34,602 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:09:34,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:09:34 BoogieIcfgContainer [2018-01-25 06:09:34,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:09:34,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:09:34,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:09:34,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:09:34,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:09:34" (1/3) ... [2018-01-25 06:09:34,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a47d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:09:34, skipping insertion in model container [2018-01-25 06:09:34,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:09:34" (2/3) ... [2018-01-25 06:09:34,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a47d506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:09:34, skipping insertion in model container [2018-01-25 06:09:34,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:09:34" (3/3) ... [2018-01-25 06:09:34,608 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-25 06:09:34,615 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:09:34,621 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 06:09:34,660 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:09:34,660 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:09:34,661 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:09:34,661 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:09:34,661 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:09:34,661 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:09:34,661 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:09:34,661 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:09:34,662 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:09:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 06:09:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:09:34,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:34,683 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 06:09:34,683 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 06:09:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-01-25 06:09:34,689 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:34,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:34,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:34,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:34,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:34,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:34,876 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 06:09:34,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:34,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:09:34,879 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:34,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:09:34,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:09:34,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:09:34,899 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 06:09:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,102 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-01-25 06:09:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:09:35,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 06:09:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,116 INFO L225 Difference]: With dead ends: 95 [2018-01-25 06:09:35,117 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 06:09:35,121 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 06:09:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 06:09:35,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-01-25 06:09:35,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 06:09:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-01-25 06:09:35,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-01-25 06:09:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:35,170 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-01-25 06:09:35,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:09:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-01-25 06:09:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:09:35,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:35,172 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 06:09:35,173 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 06:09:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-01-25 06:09:35,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:35,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:35,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:35,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:35,260 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 06:09:35,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:35,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:09:35,261 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:35,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:09:35,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:09:35,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:09:35,264 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-01-25 06:09:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,362 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-25 06:09:35,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:09:35,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:09:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,364 INFO L225 Difference]: With dead ends: 75 [2018-01-25 06:09:35,364 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 06:09:35,365 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 06:09:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 06:09:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-01-25 06:09:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 06:09:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 06:09:35,371 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-25 06:09:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:35,372 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 06:09:35,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:09:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 06:09:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 06:09:35,373 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:35,373 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 06:09:35,373 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 06:09:35,374 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-01-25 06:09:35,374 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:35,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:35,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,376 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:35,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:09:35,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:35,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:09:35,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:35,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:09:35,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:09:35,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:09:35,432 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-25 06:09:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,467 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-25 06:09:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:09:35,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 06:09:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,469 INFO L225 Difference]: With dead ends: 70 [2018-01-25 06:09:35,469 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 06:09:35,469 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 06:09:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 06:09:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-25 06:09:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 06:09:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-01-25 06:09:35,479 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-01-25 06:09:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:35,479 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-01-25 06:09:35,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:09:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-01-25 06:09:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 06:09:35,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:35,481 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 06:09:35,481 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 06:09:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-01-25 06:09:35,481 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:35,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:35,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:35,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:35,528 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 06:09:35,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:35,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:09:35,529 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:35,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:09:35,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:09:35,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:09:35,529 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-01-25 06:09:35,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,583 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-01-25 06:09:35,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:09:35,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 06:09:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,585 INFO L225 Difference]: With dead ends: 71 [2018-01-25 06:09:35,585 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 06:09:35,586 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 06:09:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 06:09:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-01-25 06:09:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 06:09:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-01-25 06:09:35,596 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-01-25 06:09:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:35,597 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-01-25 06:09:35,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:09:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-01-25 06:09:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 06:09:35,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:35,598 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 06:09:35,598 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 06:09:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-01-25 06:09:35,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:35,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:35,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:35,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:35,651 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 06:09:35,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:35,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:09:35,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:35,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:09:35,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:09:35,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:09:35,653 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-01-25 06:09:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,708 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-25 06:09:35,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:09:35,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 06:09:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,709 INFO L225 Difference]: With dead ends: 80 [2018-01-25 06:09:35,709 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 06:09:35,710 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 06:09:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 06:09:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 06:09:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 06:09:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-25 06:09:35,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-01-25 06:09:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:35,714 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-25 06:09:35,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:09:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-25 06:09:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:09:35,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:35,715 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 06:09:35,715 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 06:09:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-01-25 06:09:35,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:35,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:35,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,717 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:35,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:35,781 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 06:09:35,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:35,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:09:35,781 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:35,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:09:35,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:09:35,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:09:35,782 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-25 06:09:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,821 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 06:09:35,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:09:35,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 06:09:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,823 INFO L225 Difference]: With dead ends: 45 [2018-01-25 06:09:35,823 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 06:09:35,824 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 06:09:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 06:09:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 06:09:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 06:09:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 06:09:35,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-01-25 06:09:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:35,831 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 06:09:35,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:09:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 06:09:35,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:09:35,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:35,832 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 06:09:35,832 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 06:09:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-01-25 06:09:35,833 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:35,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:35,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:35,835 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:35,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:35,907 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 06:09:35,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:35,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:09:35,908 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:35,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:09:35,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:09:35,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:09:35,909 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-25 06:09:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:35,998 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 06:09:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:09:35,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 06:09:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:35,999 INFO L225 Difference]: With dead ends: 52 [2018-01-25 06:09:35,999 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 06:09:36,000 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 06:09:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 06:09:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-25 06:09:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 06:09:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-25 06:09:36,006 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-01-25 06:09:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:36,006 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-25 06:09:36,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:09:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-25 06:09:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:09:36,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:36,007 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 06:09:36,007 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 06:09:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-01-25 06:09:36,008 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:36,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:36,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:36,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:36,009 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:36,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:36,056 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 06:09:36,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:36,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:09:36,057 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:36,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:09:36,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:09:36,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:09:36,058 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-25 06:09:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:36,090 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-25 06:09:36,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:09:36,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 06:09:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:36,091 INFO L225 Difference]: With dead ends: 94 [2018-01-25 06:09:36,091 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 06:09:36,091 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 06:09:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 06:09:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-01-25 06:09:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 06:09:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-25 06:09:36,098 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-01-25 06:09:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:36,098 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-25 06:09:36,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:09:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-25 06:09:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:09:36,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:36,099 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 06:09:36,099 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 06:09:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-01-25 06:09:36,100 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:36,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:36,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:36,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:36,101 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:36,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:36,188 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 06:09:36,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:09:36,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:09:36,189 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:36,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:09:36,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:09:36,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:09:36,190 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-25 06:09:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:36,212 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-25 06:09:36,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:09:36,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 06:09:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:36,214 INFO L225 Difference]: With dead ends: 106 [2018-01-25 06:09:36,214 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 06:09:36,215 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 06:09:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 06:09:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-01-25 06:09:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 06:09:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 06:09:36,223 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-01-25 06:09:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:36,223 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 06:09:36,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:09:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 06:09:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:09:36,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:36,225 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 06:09:36,225 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 06:09:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-01-25 06:09:36,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:36,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:36,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:36,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:36,227 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:36,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:36,397 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 06:09:36,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:09:36,397 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:09:36,398 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:09:36,400 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 06:09:36,440 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:09:36,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:09:36,830 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:09:36,832 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 06:09:36,838 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:09:37,042 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 06:09:37,043 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:09:37,367 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:09:37,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:09:37,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-25 06:09:37,369 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:09:37,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 06:09:37,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 06:09:37,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:09:37,370 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 16 states. [2018-01-25 06:09:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:09:40,357 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-25 06:09:40,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 06:09:40,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-01-25 06:09:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:09:40,359 INFO L225 Difference]: With dead ends: 107 [2018-01-25 06:09:40,360 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 06:09:40,360 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-01-25 06:09:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 06:09:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2018-01-25 06:09:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 06:09:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-25 06:09:40,370 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2018-01-25 06:09:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:09:40,371 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-25 06:09:40,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 06:09:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-25 06:09:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:09:40,372 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:09:40,372 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 06:09:40,373 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 06:09:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-01-25 06:09:40,374 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:09:40,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:40,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:40,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:09:40,376 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:09:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:40,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:09:40,883 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 06:09:40,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:09:40,884 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:09:40,884 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:09:40,884 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 06:09:40,885 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:09:40,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:09:40,984 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:09:40,984 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 06:09:40,991 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:09:40,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:09:40,991 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 06:09:41,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:09:41,004 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:09:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:09:41,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:09:41,193 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 06:09:41,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:41,296 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 06:09:41,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:41,300 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 06:09:41,301 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:41,413 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 06:09:41,414 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:41,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:09:41,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:09:42,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:09:42,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:09:42,197 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 06:09:42,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:42,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:09:42,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:09:42,247 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 06:09:42,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:42,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:09:42,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:09:42,288 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 06:09:42,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:42,359 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 06:09:42,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:09:42,441 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 06:09:42,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 06:09:42,549 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 06:09:42,549 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:09:43,261 WARN L146 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-25 06:09:43,284 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 06:09:51,532 WARN L146 SmtUtils]: Spent 8129ms on a formula simplification. DAG size of input: 84 DAG size of output 36 [2018-01-25 06:09:51,563 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 06:09:59,812 WARN L146 SmtUtils]: Spent 8080ms on a formula simplification. DAG size of input: 83 DAG size of output 73 [2018-01-25 06:09:59,820 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:09:59,831 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:10:00,089 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 06:10:00,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:00,105 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 06:10:00,131 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 06:10:00,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:00,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:00,152 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 06:10:00,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:00,172 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 06:10:00,172 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 06:10:01,945 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 06:10:01,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:01,982 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 06:10:01,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:02,011 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 06:10:02,041 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 06:10:02,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:02,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:02,078 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 06:10:02,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 06:10:06,228 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 06:10:06,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:10:06,260 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 06:10:06,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:10:06,264 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:10:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:10:06,317 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:10:06,326 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 06:10:06,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,346 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 06:10:06,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,364 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 06:10:06,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,366 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 06:10:06,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:10:06,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:10:06,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:10:06,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:10:06,599 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 06:10:06,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:10:06,800 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 06:10:06,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:10:06,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:10:06,859 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 06:10:06,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:06,935 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 06:10:06,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:07,005 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 06:10:07,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 06:10:07,098 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 06:10:07,098 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:10:07,205 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 06:10:19,563 WARN L146 SmtUtils]: Spent 8082ms on a formula simplification. DAG size of input: 84 DAG size of output 36 [2018-01-25 06:10:19,582 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 06:10:25,286 WARN L146 SmtUtils]: Spent 1426ms on a formula simplification. DAG size of input: 83 DAG size of output 41 [2018-01-25 06:10:25,490 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 06:10:25,530 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 06:10:25,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:25,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:25,559 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 06:10:25,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:25,576 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 06:10:25,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:25,592 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 06:10:25,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 06:10:32,780 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 06:10:32,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:32,806 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 06:10:32,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:32,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 06:10:32,859 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 06:10:32,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:10:32,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:10:32,890 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 06:10:32,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 06:10:33,209 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 06:10:33,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:10:33,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 11, 11] total 32 [2018-01-25 06:10:33,211 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:10:33,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 06:10:33,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 06:10:33,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=949, Unknown=7, NotChecked=0, Total=1056 [2018-01-25 06:10:33,212 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. [2018-01-25 06:10:33,680 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-25 06:10:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:10:37,902 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:10:37,904 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:10:37,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:10:37 BoogieIcfgContainer [2018-01-25 06:10:37,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:10:37,905 INFO L168 Benchmark]: Toolchain (without parser) took 63789.58 ms. Allocated memory was 303.6 MB in the beginning and 640.2 MB in the end (delta: 336.6 MB). Free memory was 262.6 MB in the beginning and 366.1 MB in the end (delta: -103.5 MB). Peak memory consumption was 233.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:37,906 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:10:37,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.75 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 249.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:37,906 INFO L168 Benchmark]: Boogie Preprocessor took 33.87 ms. Allocated memory is still 303.6 MB. Free memory was 249.6 MB in the beginning and 247.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:37,906 INFO L168 Benchmark]: RCFGBuilder took 232.50 ms. Allocated memory is still 303.6 MB. Free memory was 247.5 MB in the beginning and 230.8 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:37,906 INFO L168 Benchmark]: TraceAbstraction took 63301.33 ms. Allocated memory was 303.6 MB in the beginning and 640.2 MB in the end (delta: 336.6 MB). Free memory was 230.8 MB in the beginning and 366.1 MB in the end (delta: -135.4 MB). Peak memory consumption was 201.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:10:37,907 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.12 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.75 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 249.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.87 ms. Allocated memory is still 303.6 MB. Free memory was 249.6 MB in the beginning and 247.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 232.50 ms. Allocated memory is still 303.6 MB. Free memory was 247.5 MB in the beginning and 230.8 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63301.33 ms. Allocated memory was 303.6 MB in the beginning and 640.2 MB in the end (delta: 336.6 MB). Free memory was 230.8 MB in the beginning and 366.1 MB in the end (delta: -135.4 MB). Peak memory consumption was 201.2 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.485460 RENAME_VARIABLES(MILLISECONDS) : 0.179988 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.438405 PROJECTAWAY(MILLISECONDS) : 0.060661 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.142838 DISJOIN(MILLISECONDS) : 0.839767 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.228030 ADD_EQUALITY(MILLISECONDS) : 0.026888 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.023427 #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.275425 RENAME_VARIABLES(MILLISECONDS) : 0.057909 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.114774 PROJECTAWAY(MILLISECONDS) : 0.035319 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.075485 DISJOIN(MILLISECONDS) : 0.390624 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.070991 ADD_EQUALITY(MILLISECONDS) : 0.014163 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004022 #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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - 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 10 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 63.2s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 425 SDslu, 1260 SDs, 0 SdLazy, 431 SolverSat, 80 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 210 GetRequests, 108 SyntacticMatches, 14 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 51.1s 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, 0.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 131 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 53.2s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 341 ConstructedInterpolants, 54 QuantifiedInterpolants, 121272 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-10-37-919.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-10-37-919.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-10-37-919.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-10-37-919.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-10-37-919.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-10-37-919.csv Completed graceful shutdown