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_mostprecise.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 20:27:00,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:27:00,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:27:00,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:27:00,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:27:00,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:27:00,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:27:00,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:27:00,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:27:00,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:27:00,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:27:00,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:27:00,582 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:27:00,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:27:00,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:27:00,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:27:00,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:27:00,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:27:00,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:27:00,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:27:00,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:27:00,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:27:00,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:27:00,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:27:00,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:27:00,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:27:00,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:27:00,599 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:27:00,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:27:00,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:27:00,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:27:00,601 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_mostprecise.epf [2018-01-24 20:27:00,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:27:00,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:27:00,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:27:00,613 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:27:00,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:27:00,613 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:27:00,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:27:00,613 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:27:00,614 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:27:00,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:27:00,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:27:00,615 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:27:00,615 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:27:00,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:27:00,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:27:00,616 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:27:00,616 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:27:00,616 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:27:00,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:27:00,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:27:00,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:27:00,617 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:27:00,617 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:27:00,617 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:27:00,617 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:27:00,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:27:00,618 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:27:00,618 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:27:00,618 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:27:00,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:27:00,619 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:27:00,619 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:27:00,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:27:00,619 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:27:00,620 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:27:00,620 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:27:00,621 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:27:00,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:27:00,669 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:27:00,674 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:27:00,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:27:00,676 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:27:00,677 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 20:27:00,867 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:27:00,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:27:00,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:27:00,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:27:00,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:27:00,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:27:00" (1/1) ... [2018-01-24 20:27:00,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cccfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:00, skipping insertion in model container [2018-01-24 20:27:00,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:27:00" (1/1) ... [2018-01-24 20:27:00,899 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:27:00,937 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:27:01,055 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:27:01,071 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:27:01,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01 WrapperNode [2018-01-24 20:27:01,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:27:01,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:27:01,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:27:01,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:27:01,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (1/1) ... [2018-01-24 20:27:01,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:27:01,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:27:01,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:27:01,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:27:01,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (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 20:27:01,158 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:27:01,159 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:27:01,159 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 20:27:01,159 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:27:01,159 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:27:01,159 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:27:01,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:27:01,159 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:27:01,159 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:27:01,159 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:27:01,160 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:27:01,160 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:27:01,160 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 20:27:01,160 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:27:01,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:27:01,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:27:01,383 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:27:01,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:27:01 BoogieIcfgContainer [2018-01-24 20:27:01,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:27:01,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:27:01,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:27:01,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:27:01,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:27:00" (1/3) ... [2018-01-24 20:27:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c5f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:27:01, skipping insertion in model container [2018-01-24 20:27:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:27:01" (2/3) ... [2018-01-24 20:27:01,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c5f0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:27:01, skipping insertion in model container [2018-01-24 20:27:01,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:27:01" (3/3) ... [2018-01-24 20:27:01,390 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-01-24 20:27:01,396 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:27:01,403 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 20:27:01,454 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:27:01,454 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:27:01,454 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:27:01,454 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:27:01,455 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:27:01,455 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:27:01,455 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:27:01,455 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:27:01,456 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:27:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 20:27:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 20:27:01,484 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:01,485 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:27:01,485 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 20:27:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-24 20:27:01,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:01,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:01,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:01,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:01,534 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:01,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:01,622 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 20:27:01,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:27:01,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:27:01,625 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:27:01,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 20:27:01,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 20:27:01,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 20:27:01,644 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-24 20:27:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:27:01,671 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 20:27:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 20:27:01,672 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-24 20:27:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:27:01,680 INFO L225 Difference]: With dead ends: 103 [2018-01-24 20:27:01,680 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 20:27:01,683 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 20:27:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 20:27:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 20:27:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 20:27:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-24 20:27:01,795 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-24 20:27:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:27:01,796 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-24 20:27:01,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 20:27:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-24 20:27:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:27:01,797 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:01,797 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:27:01,797 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 20:27:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-24 20:27:01,797 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:01,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:01,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:01,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:01,799 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:01,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:01,908 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 20:27:01,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:27:01,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:27:01,908 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:27:01,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:27:01,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:27:01,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:27:01,911 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-24 20:27:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:27:02,039 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-24 20:27:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:27:02,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 20:27:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:27:02,041 INFO L225 Difference]: With dead ends: 53 [2018-01-24 20:27:02,041 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 20:27:02,042 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 20:27:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 20:27:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 20:27:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 20:27:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 20:27:02,049 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-24 20:27:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:27:02,050 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 20:27:02,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:27:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 20:27:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:27:02,051 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:02,051 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:27:02,051 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 20:27:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-24 20:27:02,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:02,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:02,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:02,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:02,151 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 20:27:02,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:27:02,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:27:02,151 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:27:02,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:27:02,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:27:02,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:27:02,152 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-24 20:27:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:27:02,252 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-24 20:27:02,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:27:02,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 20:27:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:27:02,254 INFO L225 Difference]: With dead ends: 52 [2018-01-24 20:27:02,254 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 20:27:02,254 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 20:27:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 20:27:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 20:27:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 20:27:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-24 20:27:02,262 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-24 20:27:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:27:02,262 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-24 20:27:02,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:27:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-24 20:27:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:27:02,263 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:02,263 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 20:27:02,264 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 20:27:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-24 20:27:02,264 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:02,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:02,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,265 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:02,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:02,393 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 20:27:02,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:27:02,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:27:02,394 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:27:02,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:27:02,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:27:02,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:27:02,395 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-24 20:27:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:27:02,493 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-24 20:27:02,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:27:02,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 20:27:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:27:02,495 INFO L225 Difference]: With dead ends: 51 [2018-01-24 20:27:02,495 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 20:27:02,495 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 20:27:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 20:27:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 20:27:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 20:27:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 20:27:02,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-24 20:27:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:27:02,503 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 20:27:02,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:27:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 20:27:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:27:02,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:02,504 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 20:27:02,504 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 20:27:02,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-24 20:27:02,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:02,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:02,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:02,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:02,648 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 20:27:02,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:27:02,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:27:02,648 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:27:02,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:27:02,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:27:02,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:27:02,649 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-24 20:27:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:27:02,781 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-24 20:27:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:27:02,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 20:27:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:27:02,785 INFO L225 Difference]: With dead ends: 85 [2018-01-24 20:27:02,786 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 20:27:02,786 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 20:27:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 20:27:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-24 20:27:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 20:27:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 20:27:02,792 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-24 20:27:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:27:02,793 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 20:27:02,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:27:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 20:27:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 20:27:02,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:02,794 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 20:27:02,794 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 20:27:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-24 20:27:02,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:02,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:02,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:02,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:02,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:02,890 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 20:27:02,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:27:02,890 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:27:02,891 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 20:27:02,893 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 20:27:02,952 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:27:02,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:27:20,150 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:27:20,152 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 20:27:20,161 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:27:20,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:27:20,161 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 20:27:20,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:20,172 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:27:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:20,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:27:20,244 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 20:27:20,245 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:27:20,273 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 20:27:20,293 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:27:20,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-24 20:27:20,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:27:20,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:27:20,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:27:20,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:27:20,295 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-24 20:27:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:27:20,338 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-24 20:27:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:27:20,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 20:27:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:27:20,340 INFO L225 Difference]: With dead ends: 115 [2018-01-24 20:27:20,340 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 20:27:20,341 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 20:27:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 20:27:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-24 20:27:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 20:27:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-24 20:27:20,350 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-24 20:27:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:27:20,351 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-24 20:27:20,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:27:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-24 20:27:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:27:20,352 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:27:20,352 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 20:27:20,353 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 20:27:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-24 20:27:20,353 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:27:20,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:20,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:20,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:27:20,354 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:27:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:20,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:27:20,558 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 20:27:20,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:27:20,558 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:27:20,558 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 20:27:20,559 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 20:27:20,560 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:27:20,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 20:27:47,959 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 20:27:47,960 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 20:27:47,960 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 20:27:47,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:27:47,960 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 20:27:47,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:27:47,966 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:27:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:27:47,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:27:47,994 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:27:47,995 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:27:47,999 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:27:47,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:27:47 BoogieIcfgContainer [2018-01-24 20:27:47,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:27:48,000 INFO L168 Benchmark]: Toolchain (without parser) took 47132.31 ms. Allocated memory was 308.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 266.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 63.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:27:48,001 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:27:48,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.55 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:27:48,001 INFO L168 Benchmark]: Boogie Preprocessor took 29.81 ms. Allocated memory is still 308.3 MB. Free memory was 255.6 MB in the beginning and 253.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:27:48,002 INFO L168 Benchmark]: RCFGBuilder took 275.14 ms. Allocated memory is still 308.3 MB. Free memory was 253.5 MB in the beginning and 235.8 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:27:48,002 INFO L168 Benchmark]: TraceAbstraction took 46614.76 ms. Allocated memory was 308.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 234.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-01-24 20:27:48,003 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.21 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.55 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.81 ms. Allocated memory is still 308.3 MB. Free memory was 255.6 MB in the beginning and 253.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.14 ms. Allocated memory is still 308.3 MB. Free memory was 253.5 MB in the beginning and 235.8 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46614.76 ms. Allocated memory was 308.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 234.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 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.555110 RENAME_VARIABLES(MILLISECONDS) : 0.659866 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.249886 PROJECTAWAY(MILLISECONDS) : 0.087982 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.079080 DISJOIN(MILLISECONDS) : 0.349429 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.680725 ADD_EQUALITY(MILLISECONDS) : 0.022164 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014929 #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 * 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - 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 forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. TIMEOUT Result, 46.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.5s 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, 44.6s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-27-48-011.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-27-48-011.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-27-48-011.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-27-48-011.csv Completed graceful shutdown