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/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:41:22,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:41:22,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:41:22,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:41:22,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:41:22,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:41:22,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:41:22,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:41:22,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:41:22,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:41:22,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:41:22,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:41:22,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:41:22,958 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:41:22,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:41:22,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:41:22,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:41:22,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:41:22,967 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:41:22,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:41:22,971 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:41:22,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:41:22,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:41:22,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:41:22,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:41:22,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:41:22,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:41:22,977 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:41:22,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:41:22,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:41:22,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:41:22,978 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:41:22,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:41:22,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:41:22,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:41:22,990 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:41:22,990 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:41:22,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:41:22,991 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:41:22,991 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:41:22,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:41:22,992 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:41:22,992 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:41:22,992 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:41:22,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:41:22,993 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:41:22,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:41:22,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:41:22,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:41:22,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:41:22,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:41:22,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:41:22,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:41:22,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:41:22,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:41:22,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:41:22,995 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:41:22,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:41:22,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:41:22,996 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:41:22,996 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:41:22,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:41:22,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:41:22,996 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:41:22,996 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:41:22,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:41:22,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:41:22,997 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:41:22,997 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:41:22,998 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:41:22,998 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:41:23,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:41:23,047 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:41:23,052 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:41:23,053 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:41:23,054 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:41:23,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-21 10:41:23,256 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:41:23,259 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:41:23,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:41:23,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:41:23,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:41:23,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be986da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23, skipping insertion in model container [2018-01-21 10:41:23,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,284 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:41:23,335 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:41:23,463 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:41:23,482 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:41:23,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23 WrapperNode [2018-01-21 10:41:23,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:41:23,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:41:23,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:41:23,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:41:23,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (1/1) ... [2018-01-21 10:41:23,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:41:23,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:41:23,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:41:23,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:41:23,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (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-21 10:41:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:41:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:41:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 10:41:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 10:41:23,585 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 10:41:23,586 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 10:41:23,586 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:41:23,586 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:41:23,587 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:41:23,843 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:41:23,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:41:23 BoogieIcfgContainer [2018-01-21 10:41:23,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:41:23,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:41:23,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:41:23,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:41:23,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:41:23" (1/3) ... [2018-01-21 10:41:23,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2970a5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:41:23, skipping insertion in model container [2018-01-21 10:41:23,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:23" (2/3) ... [2018-01-21 10:41:23,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2970a5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:41:23, skipping insertion in model container [2018-01-21 10:41:23,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:41:23" (3/3) ... [2018-01-21 10:41:23,850 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-21 10:41:23,858 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:41:23,865 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 10:41:23,917 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:23,917 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:23,918 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:23,918 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:23,918 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:23,918 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:23,918 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:23,918 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 10:41:23,919 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 10:41:23,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:23,949 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:23,949 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:41:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1267872988, now seen corresponding path program 1 times [2018-01-21 10:41:23,957 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:24,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:24,162 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-21 10:41:24,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:24,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:24,164 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:24,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:24,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:24,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:24,180 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-21 10:41:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:24,469 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-21 10:41:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:24,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 10:41:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:24,479 INFO L225 Difference]: With dead ends: 129 [2018-01-21 10:41:24,479 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 10:41:24,484 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 10:41:24,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 10:41:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 10:41:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 10:41:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 10:41:24,524 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 10:41:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:24,525 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 10:41:24,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 10:41:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 10:41:24,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,528 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:24,528 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:41:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1344677638, now seen corresponding path program 1 times [2018-01-21 10:41:24,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,531 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:24,594 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:24,603 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,605 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,620 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:24,620 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:24,620 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:24,620 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:24,620 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:24,621 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:24,621 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:24,621 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:41:24,621 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:41:24,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:41:24,623 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:41:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash 144536, now seen corresponding path program 1 times [2018-01-21 10:41:24,624 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,626 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:24,635 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:24,636 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,639 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:24,639 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:24,639 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:24,639 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:24,639 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:24,639 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:24,640 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:24,640 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 10:41:24,640 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:41:24,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,644 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-21 10:41:24,644 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 10:41:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash 149863804, now seen corresponding path program 1 times [2018-01-21 10:41:24,645 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:24,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:24,680 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-21 10:41:24,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:24,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:24,681 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:24,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:41:24,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:41:24,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:41:24,682 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-21 10:41:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:24,691 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-21 10:41:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:41:24,692 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 10:41:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:24,693 INFO L225 Difference]: With dead ends: 117 [2018-01-21 10:41:24,693 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 10:41:24,694 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:41:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 10:41:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 10:41:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 10:41:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 10:41:24,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 10:41:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:24,704 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 10:41:24,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:41:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 10:41:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 10:41:24,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,706 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-21 10:41:24,706 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 10:41:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1790905482, now seen corresponding path program 1 times [2018-01-21 10:41:24,706 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,708 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:24,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:24,826 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-21 10:41:24,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:24,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:41:24,827 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:24,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:41:24,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:41:24,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:41:24,828 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 10:41:24,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:24,842 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 10:41:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:41:24,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 10:41:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:24,845 INFO L225 Difference]: With dead ends: 76 [2018-01-21 10:41:24,845 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 10:41:24,846 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-21 10:41:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 10:41:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 10:41:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:41:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 10:41:24,853 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 10:41:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:24,853 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 10:41:24,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:41:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 10:41:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:41:24,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,855 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, 1, 1] [2018-01-21 10:41:24,855 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 10:41:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1130115224, now seen corresponding path program 1 times [2018-01-21 10:41:24,855 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:24,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:24,926 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-21 10:41:24,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:24,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:41:24,926 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:24,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:41:24,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:41:24,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:24,927 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 10:41:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:24,944 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 10:41:24,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:41:24,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 10:41:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:24,945 INFO L225 Difference]: With dead ends: 50 [2018-01-21 10:41:24,945 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:24,945 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:24,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 10:41:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:24,946 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:24,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:41:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:24,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:24,949 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:24,949 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:24,949 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:24,949 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:24,949 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:24,949 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:24,949 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:24,949 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:41:24,949 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:41:24,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,951 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-21 10:41:24,951 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:41:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1879772685, now seen corresponding path program 1 times [2018-01-21 10:41:24,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,953 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:24,975 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:24,977 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,978 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,978 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,979 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,979 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:24,982 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:24,983 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:24,983 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:24,983 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:24,983 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:24,983 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:24,983 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:24,983 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:41:24,983 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 10:41:24,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:24,986 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:24,986 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:41:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1816479186, now seen corresponding path program 1 times [2018-01-21 10:41:24,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:24,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:24,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:24,989 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:24,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,022 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-21 10:41:25,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:25,022 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:25,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:25,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:25,023 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-21 10:41:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,107 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-21 10:41:25,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:25,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 10:41:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,108 INFO L225 Difference]: With dead ends: 129 [2018-01-21 10:41:25,108 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:25,108 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-21 10:41:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:25,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 10:41:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,109 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:25,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:25,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:25,111 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:25,111 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:25,111 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:25,111 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:25,111 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:25,111 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:25,111 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:25,111 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 10:41:25,111 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 10:41:25,113 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:25,113 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, 1, 1, 1, 1] [2018-01-21 10:41:25,113 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 10:41:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1609342893, now seen corresponding path program 1 times [2018-01-21 10:41:25,114 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:25,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:25,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,115 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:25,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,138 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-21 10:41:25,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:25,139 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:41:25,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:41:25,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:41:25,140 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-21 10:41:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,147 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-21 10:41:25,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:41:25,147 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 10:41:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,148 INFO L225 Difference]: With dead ends: 117 [2018-01-21 10:41:25,149 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 10:41:25,149 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:41:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 10:41:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 10:41:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 10:41:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-21 10:41:25,156 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 26 [2018-01-21 10:41:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,156 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-21 10:41:25,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:41:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-21 10:41:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:41:25,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:25,157 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:25,158 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 10:41:25,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1124045575, now seen corresponding path program 1 times [2018-01-21 10:41:25,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:25,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:25,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,159 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:25,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,234 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-21 10:41:25,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:41:25,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:41:25,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:41:25,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:41:25,236 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-01-21 10:41:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,250 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-21 10:41:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:41:25,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 10:41:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,251 INFO L225 Difference]: With dead ends: 98 [2018-01-21 10:41:25,251 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 10:41:25,252 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-21 10:41:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 10:41:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 10:41:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 10:41:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-21 10:41:25,257 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2018-01-21 10:41:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,258 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-21 10:41:25,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:41:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-21 10:41:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 10:41:25,259 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:25,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:25,259 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-21 10:41:25,259 INFO L82 PathProgramCache]: Analyzing trace with hash -69053349, now seen corresponding path program 1 times [2018-01-21 10:41:25,259 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:25,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:25,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:25,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,310 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-21 10:41:25,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:41:25,310 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:41:25,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:41:25,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:25,312 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2018-01-21 10:41:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,337 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-21 10:41:25,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:41:25,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-21 10:41:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,338 INFO L225 Difference]: With dead ends: 61 [2018-01-21 10:41:25,338 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:25,338 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:25,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-21 10:41:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,340 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:25,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:41:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:25,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:25,342 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:25,342 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:25,342 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:25,342 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:25,342 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:25,342 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:25,342 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:25,343 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 10:41:25,343 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-21 10:41:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 10:41:25,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:25,345 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:25,345 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash -457755615, now seen corresponding path program 1 times [2018-01-21 10:41:25,345 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:25,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:25,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:25,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,366 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-21 10:41:25,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:25,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:25,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:25,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:25,367 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-21 10:41:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,449 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-21 10:41:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:25,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 10:41:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,451 INFO L225 Difference]: With dead ends: 129 [2018-01-21 10:41:25,452 INFO L226 Difference]: Without dead ends: 67 [2018-01-21 10:41:25,452 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 10:41:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-21 10:41:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-01-21 10:41:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 10:41:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-21 10:41:25,463 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 15 [2018-01-21 10:41:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,463 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-21 10:41:25,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-21 10:41:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:41:25,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:25,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:25,465 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1418378797, now seen corresponding path program 1 times [2018-01-21 10:41:25,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:25,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:25,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:25,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,542 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-21 10:41:25,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:41:25,542 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:41:25,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:41:25,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:41:25,543 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-21 10:41:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,569 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-01-21 10:41:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:41:25,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 10:41:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,571 INFO L225 Difference]: With dead ends: 104 [2018-01-21 10:41:25,571 INFO L226 Difference]: Without dead ends: 57 [2018-01-21 10:41:25,571 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-21 10:41:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-21 10:41:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-21 10:41:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 10:41:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-21 10:41:25,587 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 32 [2018-01-21 10:41:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,588 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-21 10:41:25,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:41:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-21 10:41:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 10:41:25,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:25,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:25,590 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 121111435, now seen corresponding path program 1 times [2018-01-21 10:41:25,590 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:25,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:25,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:25,592 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:25,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:25,644 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-21 10:41:25,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:25,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:41:25,647 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:25,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:41:25,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:41:25,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:25,648 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2018-01-21 10:41:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:25,668 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-21 10:41:25,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:41:25,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-21 10:41:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:25,669 INFO L225 Difference]: With dead ends: 64 [2018-01-21 10:41:25,669 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:25,670 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:25,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-21 10:41:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:25,671 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:25,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:41:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:25,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:25,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:41:25 BoogieIcfgContainer [2018-01-21 10:41:25,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:41:25,675 INFO L168 Benchmark]: Toolchain (without parser) took 2418.66 ms. Allocated memory was 300.4 MB in the beginning and 472.9 MB in the end (delta: 172.5 MB). Free memory was 257.7 MB in the beginning and 433.5 MB in the end (delta: -175.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:41:25,676 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:41:25,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.16 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 244.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:25,677 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 300.4 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:25,677 INFO L168 Benchmark]: RCFGBuilder took 309.83 ms. Allocated memory is still 300.4 MB. Free memory was 242.7 MB in the beginning and 221.9 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:25,678 INFO L168 Benchmark]: TraceAbstraction took 1829.71 ms. Allocated memory was 300.4 MB in the beginning and 472.9 MB in the end (delta: 172.5 MB). Free memory was 221.9 MB in the beginning and 433.5 MB in the end (delta: -211.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:41:25,679 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.20 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.16 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 244.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 300.4 MB. Free memory was 244.7 MB in the beginning and 242.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 309.83 ms. Allocated memory is still 300.4 MB. Free memory was 242.7 MB in the beginning and 221.9 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1829.71 ms. Allocated memory was 300.4 MB in the beginning and 472.9 MB in the end (delta: 172.5 MB). Free memory was 221.9 MB in the beginning and 433.5 MB in the end (delta: -211.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1479] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 37 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: alloc_17Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1479] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=10] [L1479] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1478]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1457]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: free_17Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 141 SDtfs, 3 SDslu, 172 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1464]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 36 SDslu, 195 SDs, 0 SdLazy, 50 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 3638 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-41-25-691.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_10-41-25-691.csv Received shutdown request...