java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:15:00,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:15:00,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:15:00,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:15:00,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:15:00,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:15:00,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:15:00,343 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:15:00,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:15:00,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:15:00,357 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:15:00,357 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:15:00,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:15:00,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:15:00,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:15:00,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:15:00,398 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:15:00,400 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:15:00,402 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:15:00,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:15:00,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:15:00,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:15:00,414 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:15:00,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:15:00,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:15:00,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:15:00,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:15:00,435 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:15:00,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:15:00,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:15:00,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:15:00,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:15:00,463 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:15:00,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:15:00,467 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:15:00,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:15:00,468 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:15:00,468 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:15:00,468 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:15:00,468 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:15:00,469 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:15:00,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:15:00,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:15:00,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:15:00,477 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:15:00,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:15:00,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:15:00,478 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:15:00,478 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:15:00,478 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:15:00,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:15:00,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:15:00,479 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:15:00,479 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:15:00,479 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:15:00,479 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:15:00,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:15:00,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:15:00,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:15:00,482 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:15:00,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:15:00,482 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:15:00,482 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:15:00,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:15:00,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:15:00,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:15:00,483 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:15:00,484 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:15:00,484 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:15:00,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:15:00,600 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:15:00,611 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:15:00,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:15:00,613 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:15:00,614 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-deref.i [2018-01-25 03:15:00,967 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:15:00,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:15:00,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:15:00,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:15:00,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:15:00,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:15:00" (1/1) ... [2018-01-25 03:15:00,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@915507d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:00, skipping insertion in model container [2018-01-25 03:15:00,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:15:00" (1/1) ... [2018-01-25 03:15:01,027 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:15:01,132 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:15:01,314 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:15:01,351 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:15:01,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01 WrapperNode [2018-01-25 03:15:01,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:15:01,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:15:01,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:15:01,365 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:15:01,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (1/1) ... [2018-01-25 03:15:01,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:15:01,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:15:01,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:15:01,408 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:15:01,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15: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-25 03:15:01,483 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:15:01,484 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:15:01,484 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 03:15:01,484 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:15:01,484 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:15:01,484 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:15:01,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:15:01,485 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:15:01,485 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:15:01,485 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:15:01,485 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:15:01,485 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:15:01,486 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 03:15:01,486 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:15:01,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:15:01,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:15:01,863 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:15:01,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:15:01 BoogieIcfgContainer [2018-01-25 03:15:01,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:15:01,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:15:01,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:15:01,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:15:01,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:15:00" (1/3) ... [2018-01-25 03:15:01,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:15:01, skipping insertion in model container [2018-01-25 03:15:01,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:15:01" (2/3) ... [2018-01-25 03:15:01,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebca8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:15:01, skipping insertion in model container [2018-01-25 03:15:01,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:15:01" (3/3) ... [2018-01-25 03:15:01,873 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-deref.i [2018-01-25 03:15:01,883 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:15:01,892 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 03:15:01,956 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:15:01,956 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:15:01,957 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:15:01,957 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:15:01,957 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:15:01,957 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:15:01,957 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:15:01,958 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:15:01,959 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:15:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-25 03:15:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 03:15:01,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:01,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:01,997 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-25 03:15:02,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:02,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:02,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:02,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:02,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:02,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:02,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:02,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:15:02,240 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:02,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:15:02,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:15:02,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:15:02,263 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-25 03:15:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:02,295 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-25 03:15:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:15:02,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 03:15:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:02,307 INFO L225 Difference]: With dead ends: 103 [2018-01-25 03:15:02,308 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 03:15:02,446 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-25 03:15:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 03:15:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 03:15:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 03:15:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-25 03:15:02,495 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-25 03:15:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:02,496 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-25 03:15:02,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:15:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-25 03:15:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:15:02,497 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:02,497 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:02,497 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-25 03:15:02,498 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:02,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:02,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:02,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:02,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:02,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:02,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:02,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:15:02,763 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:02,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:15:02,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:15:02,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:15:02,766 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-25 03:15:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:03,079 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-25 03:15:03,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:15:03,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 03:15:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:03,081 INFO L225 Difference]: With dead ends: 53 [2018-01-25 03:15:03,081 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 03:15:03,082 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:15:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 03:15:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 03:15:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 03:15:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 03:15:03,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-25 03:15:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:03,097 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 03:15:03,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:15:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 03:15:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:15:03,098 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:03,098 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:03,098 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:03,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-25 03:15:03,099 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:03,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:03,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:03,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:03,101 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:03,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:03,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:03,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:15:03,448 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:03,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:15:03,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:15:03,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:15:03,449 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-25 03:15:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:03,629 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-25 03:15:03,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:15:03,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:15:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:03,633 INFO L225 Difference]: With dead ends: 52 [2018-01-25 03:15:03,633 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 03:15:03,633 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 03:15:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 03:15:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 03:15:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-25 03:15:03,647 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-25 03:15:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:03,648 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-25 03:15:03,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:15:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-25 03:15:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:15:03,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:03,649 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:03,649 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-25 03:15:03,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:03,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:03,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:03,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:03,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:03,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:03,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:03,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:15:03,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:03,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:15:03,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:15:03,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:15:03,779 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-25 03:15:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:03,902 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-25 03:15:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:15:03,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 03:15:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:03,906 INFO L225 Difference]: With dead ends: 51 [2018-01-25 03:15:03,906 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 03:15:03,907 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-25 03:15:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 03:15:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 03:15:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 03:15:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-25 03:15:03,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-25 03:15:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:03,914 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-25 03:15:03,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:15:03,914 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-25 03:15:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:15:03,915 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:03,915 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:15:03,915 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-25 03:15:03,916 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:03,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:03,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:03,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:03,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:03,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:15:04,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:15:04,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:15:04,144 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:04,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:15:04,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:15:04,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:15:04,145 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-25 03:15:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:04,303 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-25 03:15:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:15:04,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 03:15:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:04,306 INFO L225 Difference]: With dead ends: 85 [2018-01-25 03:15:04,306 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 03:15:04,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:15:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 03:15:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-25 03:15:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:15:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 03:15:04,314 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-25 03:15:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:04,314 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 03:15:04,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:15:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 03:15:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:15:04,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:04,315 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-25 03:15:04,315 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-25 03:15:04,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:04,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:04,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:04,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:04,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:04,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:04,415 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-25 03:15:04,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:15:04,415 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:15:04,416 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 03:15:04,418 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-25 03:15:04,485 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:15:04,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:15:28,251 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:15:28,253 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-25 03:15:28,262 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:15:28,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:15:28,263 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:15:28,270 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:28,270 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:15:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:28,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:15:28,343 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-25 03:15:28,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:15:28,381 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-25 03:15:28,421 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:15:28,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-25 03:15:28,421 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:15:28,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:15:28,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:15:28,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:15:28,425 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-25 03:15:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:15:28,540 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-25 03:15:28,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:15:28,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 03:15:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:15:28,544 INFO L225 Difference]: With dead ends: 115 [2018-01-25 03:15:28,544 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 03:15:28,545 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-25 03:15:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 03:15:28,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-25 03:15:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 03:15:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-25 03:15:28,555 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-25 03:15:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:15:28,555 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-25 03:15:28,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:15:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-25 03:15:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:15:28,557 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:15:28,557 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-25 03:15:28,557 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:15:28,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-25 03:15:28,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:15:28,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:28,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:28,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:15:28,559 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:15:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:28,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:15:29,081 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-25 03:15:29,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:15:29,082 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:15:29,082 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 03:15:29,083 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-25 03:15:29,084 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:15:29,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:15:48,710 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:15:48,711 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:15:48,711 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:15:48,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:15:48,711 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-25 03:15:48,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:15:48,720 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:15:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:15:48,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:15:48,785 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:15:48,785 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:15:48,789 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:15:48,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:15:48 BoogieIcfgContainer [2018-01-25 03:15:48,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:15:48,791 INFO L168 Benchmark]: Toolchain (without parser) took 47823.27 ms. Allocated memory was 307.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 266.1 MB in the beginning and 412.1 MB in the end (delta: -145.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-25 03:15:48,791 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:15:48,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.67 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:15:48,791 INFO L168 Benchmark]: Boogie Preprocessor took 42.45 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:15:48,792 INFO L168 Benchmark]: RCFGBuilder took 456.13 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 235.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-25 03:15:48,792 INFO L168 Benchmark]: TraceAbstraction took 46925.16 ms. Allocated memory was 307.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 235.2 MB in the beginning and 412.1 MB in the end (delta: -176.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-25 03:15:48,793 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.24 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 388.67 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.45 ms. Allocated memory is still 307.2 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 456.13 ms. Allocated memory is still 307.2 MB. Free memory was 254.2 MB in the beginning and 235.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46925.16 ms. Allocated memory was 307.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 235.2 MB in the beginning and 412.1 MB in the end (delta: -176.8 MB). Peak memory consumption was 1.1 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) : 10.942216 RENAME_VARIABLES(MILLISECONDS) : 1.167886 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.062416 PROJECTAWAY(MILLISECONDS) : 0.160010 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.044742 DISJOIN(MILLISECONDS) : 0.586978 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.234964 ADD_EQUALITY(MILLISECONDS) : 0.024929 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014644 #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.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 253 SDtfs, 270 SDslu, 310 SDs, 0 SdLazy, 265 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s 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, 43.4s 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.2s SatisfiabilityAnalysisTime, 0.9s 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-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-15-48-802.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-15-48-802.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-15-48-802.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-15-48-802.csv Completed graceful shutdown