java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:50:58,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:50:58,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:50:58,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:50:58,180 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:50:58,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:50:58,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:50:58,184 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:50:58,185 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:50:58,186 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:50:58,187 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:50:58,187 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:50:58,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:50:58,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:50:58,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:50:58,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:50:58,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:50:58,197 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:50:58,198 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:50:58,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:50:58,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:50:58,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:50:58,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:50:58,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:50:58,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:50:58,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:50:58,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:50:58,207 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:50:58,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:50:58,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:50:58,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:50:58,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:50:58,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:50:58,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:50:58,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:50:58,221 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:50:58,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:50:58,221 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:50:58,221 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:50:58,221 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:50:58,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:50:58,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:50:58,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:50:58,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:50:58,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:50:58,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:50:58,224 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:50:58,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:50:58,224 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:50:58,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:50:58,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:50:58,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:50:58,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:50:58,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:50:58,225 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:50:58,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:50:58,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:50:58,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:50:58,226 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:50:58,226 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:50:58,226 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:50:58,227 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:50:58,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:50:58,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:50:58,227 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:50:58,227 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:50:58,228 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:50:58,229 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:50:58,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:50:58,280 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:50:58,285 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:50:58,287 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:50:58,287 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:50:58,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-01-24 23:50:58,474 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:50:58,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:50:58,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:50:58,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:50:58,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:50:58,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73691d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58, skipping insertion in model container [2018-01-24 23:50:58,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,513 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:50:58,556 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:50:58,686 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:50:58,702 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:50:58,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58 WrapperNode [2018-01-24 23:50:58,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:50:58,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:50:58,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:50:58,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:50:58,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (1/1) ... [2018-01-24 23:50:58,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:50:58,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:50:58,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:50:58,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:50:58,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (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-24 23:50:58,798 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:50:58,798 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:50:58,798 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 23:50:58,799 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:50:58,799 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:50:58,800 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 23:50:58,800 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:50:58,800 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:50:58,800 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:50:59,024 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:50:59,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:50:59 BoogieIcfgContainer [2018-01-24 23:50:59,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:50:59,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:50:59,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:50:59,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:50:59,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:50:58" (1/3) ... [2018-01-24 23:50:59,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4709647d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:50:59, skipping insertion in model container [2018-01-24 23:50:59,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:50:58" (2/3) ... [2018-01-24 23:50:59,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4709647d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:50:59, skipping insertion in model container [2018-01-24 23:50:59,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:50:59" (3/3) ... [2018-01-24 23:50:59,033 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-01-24 23:50:59,042 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:50:59,051 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 23:50:59,098 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:50:59,098 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:50:59,098 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:50:59,099 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:50:59,099 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:50:59,099 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:50:59,099 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:50:59,099 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:50:59,100 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:50:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 23:50:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 23:50:59,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:50:59,126 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:50:59,126 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:50:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-24 23:50:59,132 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:50:59,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:50:59,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:50:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:50:59,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:50:59,265 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-24 23:50:59,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:50:59,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:50:59,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:50:59,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 23:50:59,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 23:50:59,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 23:50:59,284 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-24 23:50:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:50:59,390 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 23:50:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 23:50:59,391 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 23:50:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:50:59,401 INFO L225 Difference]: With dead ends: 103 [2018-01-24 23:50:59,401 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 23:50:59,405 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-24 23:50:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 23:50:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 23:50:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:50:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 23:50:59,445 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-24 23:50:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:50:59,445 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 23:50:59,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 23:50:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 23:50:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:50:59,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:50:59,446 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:50:59,446 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:50:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-24 23:50:59,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:50:59,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:50:59,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:50:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:50:59,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:50:59,548 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-24 23:50:59,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:50:59,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:50:59,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:50:59,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:50:59,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:50:59,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:50:59,552 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-24 23:50:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:50:59,678 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-24 23:50:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:50:59,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:50:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:50:59,680 INFO L225 Difference]: With dead ends: 53 [2018-01-24 23:50:59,680 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:50:59,682 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:50:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:50:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:50:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:50:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 23:50:59,689 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-24 23:50:59,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:50:59,690 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 23:50:59,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:50:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 23:50:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:50:59,691 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:50:59,691 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:50:59,691 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:50:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-24 23:50:59,691 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:50:59,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:50:59,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,693 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:50:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:50:59,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:50:59,813 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-24 23:50:59,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:50:59,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:50:59,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:50:59,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:50:59,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:50:59,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:50:59,815 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 23:50:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:50:59,914 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-24 23:50:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:50:59,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:50:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:50:59,916 INFO L225 Difference]: With dead ends: 52 [2018-01-24 23:50:59,916 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:50:59,916 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:50:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:50:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:50:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:50:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 23:50:59,921 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-24 23:50:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:50:59,922 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 23:50:59,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:50:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 23:50:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:50:59,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:50:59,923 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-24 23:50:59,923 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:50:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-24 23:50:59,923 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:50:59,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:50:59,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:50:59,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:50:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:50:59,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:51:00,030 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-24 23:51:00,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:51:00,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:51:00,030 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:51:00,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:51:00,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:51:00,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:51:00,032 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-24 23:51:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:51:00,147 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-24 23:51:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:51:00,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 23:51:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:51:00,148 INFO L225 Difference]: With dead ends: 51 [2018-01-24 23:51:00,148 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 23:51:00,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:51:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 23:51:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 23:51:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 23:51:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 23:51:00,153 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-24 23:51:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:51:00,153 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 23:51:00,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:51:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 23:51:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:51:00,154 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:51:00,154 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-24 23:51:00,154 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:51:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-24 23:51:00,154 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:51:00,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:51:00,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:51:00,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:51:00,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:51:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:51:00,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:51:00,303 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-24 23:51:00,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:51:00,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:51:00,304 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:51:00,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:51:00,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:51:00,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:51:00,305 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-24 23:51:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:51:00,438 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-24 23:51:00,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:51:00,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 23:51:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:51:00,442 INFO L225 Difference]: With dead ends: 85 [2018-01-24 23:51:00,443 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 23:51:00,443 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:51:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 23:51:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-24 23:51:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 23:51:00,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 23:51:00,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-24 23:51:00,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:51:00,452 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 23:51:00,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:51:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 23:51:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:51:00,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:51:00,453 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:51:00,454 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:51:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-24 23:51:00,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:51:00,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:51:00,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:51:00,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:51:00,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:51:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:51:00,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:51:00,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:51:00,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:51:00,545 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:51:00,546 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 23:51:00,548 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [90], [91], [92], [94] [2018-01-24 23:51:00,599 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:51:00,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:51:17,954 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:51:17,955 INFO L268 AbstractInterpreter]: Visited 22 different actions 31 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 23:51:17,962 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:51:17,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:51:17,962 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:51:17,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:51:17,971 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:51:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:51:18,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:51:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:51:18,040 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:51:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:51:18,105 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 23:51:18,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-24 23:51:18,105 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:51:18,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:51:18,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:51:18,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:51:18,106 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 23:51:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:51:18,152 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-24 23:51:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:51:18,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 23:51:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:51:18,153 INFO L225 Difference]: With dead ends: 115 [2018-01-24 23:51:18,153 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 23:51:18,154 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:51:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 23:51:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-24 23:51:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 23:51:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-24 23:51:18,160 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-24 23:51:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:51:18,160 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-24 23:51:18,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:51:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-24 23:51:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:51:18,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:51:18,161 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:51:18,161 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-24 23:51:18,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-24 23:51:18,161 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:51:18,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:51:18,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:51:18,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:51:18,162 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:51:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:51:18,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:51:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:51:18,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:51:18,370 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:51:18,370 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 23:51:18,371 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [90], [91], [92], [94] [2018-01-24 23:51:18,372 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:51:18,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:51:46,298 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:51:46,298 INFO L268 AbstractInterpreter]: Visited 23 different actions 58 times. Merged at 15 different actions 28 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-24 23:51:46,300 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:51:46,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:51:46,301 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:51:46,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:51:46,306 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:51:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:51:46,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:51:46,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 23:51:46,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:51:46,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:51:46,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 23:51:46,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 23:51:46,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:51:46,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:51:46,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-24 23:51:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:51:46,507 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-24 23:51:46,848 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:51:46,848 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:51:46,852 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:51:46,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:51:46 BoogieIcfgContainer [2018-01-24 23:51:46,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:51:46,853 INFO L168 Benchmark]: Toolchain (without parser) took 48378.26 ms. Allocated memory was 305.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 264.6 MB in the beginning and 327.1 MB in the end (delta: -62.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-24 23:51:46,853 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:51:46,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.63 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:51:46,854 INFO L168 Benchmark]: Boogie Preprocessor took 36.97 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 23:51:46,854 INFO L168 Benchmark]: RCFGBuilder took 277.81 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 233.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-24 23:51:46,854 INFO L168 Benchmark]: TraceAbstraction took 47826.31 ms. Allocated memory was 305.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 233.5 MB in the beginning and 327.1 MB in the end (delta: -93.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-24 23:51:46,855 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.19 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.63 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.97 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.81 ms. Allocated memory is still 305.7 MB. Free memory was 252.4 MB in the beginning and 233.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47826.31 ms. Allocated memory was 305.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 233.5 MB in the beginning and 327.1 MB in the end (delta: -93.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 321 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.588064 RENAME_VARIABLES(MILLISECONDS) : 0.929503 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.202145 PROJECTAWAY(MILLISECONDS) : 0.089832 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065257 DISJOIN(MILLISECONDS) : 0.361928 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.956787 ADD_EQUALITY(MILLISECONDS) : 0.036641 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014329 #CONJOIN_DISJUNCTIVE : 52 #RENAME_VARIABLES : 95 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 312 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.972426 RENAME_VARIABLES(MILLISECONDS) : 0.781964 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.908998 PROJECTAWAY(MILLISECONDS) : 0.105912 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.039287 DISJOIN(MILLISECONDS) : 0.407305 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.803458 ADD_EQUALITY(MILLISECONDS) : 0.017241 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014658 #CONJOIN_DISJUNCTIVE : 89 #RENAME_VARIABLES : 175 #UNFREEZE : 0 #CONJOIN : 158 #PROJECTAWAY : 124 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 163 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. TIMEOUT Result, 47.7s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 270 SDslu, 312 SDs, 0 SdLazy, 261 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 11561 SizeOfPredicates, 2 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 7/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-51-46-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-51-46-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-51-46-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_23-51-46-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_23-51-46-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-51-46-866.csv Completed graceful shutdown