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/memsafety/lockfree-3.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:10:46,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:10:46,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:10:46,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:10:46,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:10:46,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:10:46,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:10:46,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:10:46,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:10:46,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:10:46,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:10:46,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:10:46,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:10:46,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:10:46,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:10:46,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:10:46,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:10:46,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:10:46,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:10:46,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:10:46,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:10:46,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:10:46,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:10:46,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:10:46,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:10:46,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:10:46,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:10:46,079 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:10:46,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:10:46,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:10:46,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:10:46,080 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:10:46,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:10:46,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:10:46,090 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:10:46,090 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:10:46,090 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:10:46,090 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:10:46,091 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:10:46,091 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:10:46,091 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:10:46,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:10:46,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:10:46,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:10:46,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:10:46,093 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:10:46,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:10:46,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:10:46,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:10:46,093 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:10:46,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:10:46,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:10:46,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:10:46,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:10:46,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:10:46,094 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:10:46,094 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:10:46,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:10:46,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:10:46,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:10:46,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:10:46,096 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:10:46,096 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:10:46,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:10:46,142 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:10:46,146 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:10:46,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:10:46,147 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:10:46,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-01-24 20:10:46,301 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:10:46,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:10:46,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:10:46,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:10:46,311 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:10:46,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28805b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46, skipping insertion in model container [2018-01-24 20:10:46,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,329 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:10:46,368 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:10:46,492 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:10:46,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:10:46,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46 WrapperNode [2018-01-24 20:10:46,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:10:46,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:10:46,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:10:46,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:10:46,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (1/1) ... [2018-01-24 20:10:46,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:10:46,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:10:46,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:10:46,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:10:46,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (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:10:46,619 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:10:46,619 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:10:46,619 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 20:10:46,619 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 20:10:46,619 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:10:46,620 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:10:46,620 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:10:46,620 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:10:46,620 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:10:46,620 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:10:46,620 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 20:10:46,621 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:10:46,622 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:10:46,622 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:10:46,979 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:10:46,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:10:46 BoogieIcfgContainer [2018-01-24 20:10:46,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:10:46,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:10:46,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:10:46,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:10:46,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:10:46" (1/3) ... [2018-01-24 20:10:46,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348c0861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:10:46, skipping insertion in model container [2018-01-24 20:10:46,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:10:46" (2/3) ... [2018-01-24 20:10:46,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348c0861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:10:46, skipping insertion in model container [2018-01-24 20:10:46,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:10:46" (3/3) ... [2018-01-24 20:10:46,986 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-01-24 20:10:46,993 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:10:47,000 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 20:10:47,036 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:10:47,037 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:10:47,037 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:10:47,037 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:10:47,037 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:10:47,037 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:10:47,037 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:10:47,037 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:10:47,038 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:10:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 20:10:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 20:10:47,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:47,060 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:47,060 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 20:10:47,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:47,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:47,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,108 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:47,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:47,216 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:10:47,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:47,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:10:47,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:47,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 20:10:47,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 20:10:47,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 20:10:47,239 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 20:10:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:47,344 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 20:10:47,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 20:10:47,345 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 20:10:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:47,359 INFO L225 Difference]: With dead ends: 92 [2018-01-24 20:10:47,359 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 20:10:47,362 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:10:47,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 20:10:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 20:10:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 20:10:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 20:10:47,399 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 20:10:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:47,399 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 20:10:47,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 20:10:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 20:10:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 20:10:47,400 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:47,400 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:47,400 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 20:10:47,401 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:47,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:47,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,403 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:47,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:47,471 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:10:47,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:47,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:10:47,471 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:47,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:10:47,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:10:47,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:10:47,474 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 20:10:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:47,495 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 20:10:47,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:10:47,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 20:10:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:47,497 INFO L225 Difference]: With dead ends: 87 [2018-01-24 20:10:47,497 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 20:10:47,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:10:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 20:10:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 20:10:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 20:10:47,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 20:10:47,507 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 20:10:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:47,507 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 20:10:47,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:10:47,508 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 20:10:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 20:10:47,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:47,508 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:47,509 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 20:10:47,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:47,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:47,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:47,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:47,617 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:10:47,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:47,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:10:47,618 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:47,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:10:47,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:10:47,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:10:47,619 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 20:10:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:47,660 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 20:10:47,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:10:47,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 20:10:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:47,662 INFO L225 Difference]: With dead ends: 145 [2018-01-24 20:10:47,663 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 20:10:47,663 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:10:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 20:10:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 20:10:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 20:10:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 20:10:47,681 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 20:10:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:47,681 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 20:10:47,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:10:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 20:10:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:10:47,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:47,682 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:47,683 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 20:10:47,683 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:47,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:47,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,685 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:47,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:47,741 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:10:47,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:47,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:10:47,741 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:47,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:10:47,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:10:47,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:10:47,742 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 20:10:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:47,836 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 20:10:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:10:47,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 20:10:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:47,839 INFO L225 Difference]: With dead ends: 148 [2018-01-24 20:10:47,839 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 20:10:47,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:10:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 20:10:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 20:10:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 20:10:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 20:10:47,859 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 20:10:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:47,859 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 20:10:47,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:10:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 20:10:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 20:10:47,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:47,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:47,860 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 20:10:47,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:47,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:47,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:47,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:47,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:47,933 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:10:47,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:47,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:10:47,933 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:47,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:10:47,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:10:47,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:10:47,934 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 20:10:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:48,055 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 20:10:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:10:48,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 20:10:48,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:48,057 INFO L225 Difference]: With dead ends: 385 [2018-01-24 20:10:48,058 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 20:10:48,059 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:10:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 20:10:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 20:10:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 20:10:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 20:10:48,083 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 20:10:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:48,083 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 20:10:48,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:10:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 20:10:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:10:48,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:48,084 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:48,084 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 20:10:48,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:48,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:48,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:48,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:48,141 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:10:48,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:48,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:10:48,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:48,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:10:48,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:10:48,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:10:48,143 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 20:10:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:48,272 INFO L93 Difference]: Finished difference Result 392 states and 582 transitions. [2018-01-24 20:10:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:10:48,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 20:10:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:48,277 INFO L225 Difference]: With dead ends: 392 [2018-01-24 20:10:48,277 INFO L226 Difference]: Without dead ends: 388 [2018-01-24 20:10:48,278 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:10:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-24 20:10:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-01-24 20:10:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 20:10:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 20:10:48,313 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 20:10:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:48,313 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 20:10:48,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:10:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 20:10:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:10:48,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:48,315 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:48,315 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 20:10:48,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:48,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:48,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:48,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:48,381 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:10:48,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:48,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:10:48,382 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:48,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:10:48,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:10:48,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:10:48,383 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 20:10:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:48,566 INFO L93 Difference]: Finished difference Result 491 states and 729 transitions. [2018-01-24 20:10:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:10:48,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 20:10:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:48,571 INFO L225 Difference]: With dead ends: 491 [2018-01-24 20:10:48,572 INFO L226 Difference]: Without dead ends: 487 [2018-01-24 20:10:48,572 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:10:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-01-24 20:10:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-01-24 20:10:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 20:10:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 20:10:48,606 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 20:10:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:48,607 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 20:10:48,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:10:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 20:10:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 20:10:48,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:48,608 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:48,608 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:48,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 20:10:48,609 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:48,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:48,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,610 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:48,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:48,686 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:10:48,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:10:48,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:10:48,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:48,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:10:48,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:10:48,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:10:48,688 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 20:10:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:10:48,849 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 20:10:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:10:48,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 20:10:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:10:48,884 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 20:10:48,884 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 20:10:48,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:10:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 20:10:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 20:10:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 20:10:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 20:10:48,950 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 20:10:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:10:48,951 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 20:10:48,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:10:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 20:10:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:10:48,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:10:48,953 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:10:48,953 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:10:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 20:10:48,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:10:48,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:10:48,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:10:48,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:10:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:10:48,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:10:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:10:49,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:10:49,065 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:10:49,066 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 20:10:49,068 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 20:10:49,128 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:10:49,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:10:49,391 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:10:49,393 INFO L268 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 39 variables. [2018-01-24 20:10:49,418 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:10:49,568 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 82.63% of their original sizes. [2018-01-24 20:10:49,568 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:10:49,587 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:10:49,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:10:49,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-24 20:10:49,588 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:10:49,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:10:49,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:10:49,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:10:49,589 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-24 20:11:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:42,874 INFO L93 Difference]: Finished difference Result 1710 states and 2487 transitions. [2018-01-24 20:11:42,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:11:42,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 20:11:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:42,879 INFO L225 Difference]: With dead ends: 1710 [2018-01-24 20:11:42,880 INFO L226 Difference]: Without dead ends: 887 [2018-01-24 20:11:42,883 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:11:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-01-24 20:11:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 864. [2018-01-24 20:11:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-01-24 20:11:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1256 transitions. [2018-01-24 20:11:42,944 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1256 transitions. Word has length 26 [2018-01-24 20:11:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:42,944 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 1256 transitions. [2018-01-24 20:11:42,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:11:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1256 transitions. [2018-01-24 20:11:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:11:42,946 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:42,946 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:11:42,946 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 20:11:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-24 20:11:42,947 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:42,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:42,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:42,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:42,948 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:42,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:11:43,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:11:43,033 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:11:43,033 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 20:11:43,034 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 20:11:43,035 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:11:43,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:11:43,222 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:11:43,222 INFO L268 AbstractInterpreter]: Visited 20 different actions 43 times. Merged at 7 different actions 9 times. Never widened. Found 2 fixpoints after 1 different actions. Largest state had 39 variables. [2018-01-24 20:11:43,226 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:11:43,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:11:43,227 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:11:43,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:43,239 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:11:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:43,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:11:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:11:43,449 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:11:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. Received shutdown request... [2018-01-24 20:11:43,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:11:43,700 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:11:43,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:43,706 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:11:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:43,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:11:43,827 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:11:43,827 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:11:43,832 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:11:43,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:11:43 BoogieIcfgContainer [2018-01-24 20:11:43,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:11:43,834 INFO L168 Benchmark]: Toolchain (without parser) took 57532.26 ms. Allocated memory was 300.4 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 260.3 MB in the beginning and 757.0 MB in the end (delta: -496.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 20:11:43,834 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:11:43,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.54 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 248.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:43,835 INFO L168 Benchmark]: Boogie Preprocessor took 43.46 ms. Allocated memory is still 300.4 MB. Free memory was 248.2 MB in the beginning and 246.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:43,835 INFO L168 Benchmark]: RCFGBuilder took 410.62 ms. Allocated memory is still 300.4 MB. Free memory was 246.2 MB in the beginning and 220.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:43,836 INFO L168 Benchmark]: TraceAbstraction took 56851.78 ms. Allocated memory was 300.4 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 220.3 MB in the beginning and 757.0 MB in the end (delta: -536.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 20:11:43,837 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.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.54 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 248.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.46 ms. Allocated memory is still 300.4 MB. Free memory was 248.2 MB in the beginning and 246.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 410.62 ms. Allocated memory is still 300.4 MB. Free memory was 246.2 MB in the beginning and 220.3 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56851.78 ms. Allocated memory was 300.4 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 220.3 MB in the beginning and 757.0 MB in the end (delta: -536.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 7 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -14 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 12 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 96 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 16 TransStat_MAX_NO_DISJUNCTIONS : 5 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.768825 RENAME_VARIABLES(MILLISECONDS) : 0.165635 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.720768 PROJECTAWAY(MILLISECONDS) : 0.047628 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.454936 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.206688 ADD_EQUALITY(MILLISECONDS) : 0.046288 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013329 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 27 #UNFREEZE : 0 #CONJOIN : 109 #PROJECTAWAY : 26 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 93 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 406 LocStat_NO_SUPPORTING_DISEQUALITIES : 3 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 144 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 5 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.657811 RENAME_VARIABLES(MILLISECONDS) : 0.074414 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.626816 PROJECTAWAY(MILLISECONDS) : 0.089502 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.140778 DISJOIN(MILLISECONDS) : 0.169424 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.096555 ADD_EQUALITY(MILLISECONDS) : 0.013986 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017745 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 179 #UNFREEZE : 0 #CONJOIN : 261 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 155 #ADD_EQUALITY : 140 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 682). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 682). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 681). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 672). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 672). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 698). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 697). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 698). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 697). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 27 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 635). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 634). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 634). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 644). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 644). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 635). Cancelled while BasicCegarLoop was analyzing trace of length 27 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 27 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 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 56.8s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 54.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 857 SDtfs, 425 SDslu, 1208 SDs, 0 SdLazy, 276 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.28 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 168 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 4489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 7/8 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/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-11-43-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-11-43-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-11-43-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_20-11-43-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_20-11-43-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-11-43-850.csv Completed graceful shutdown