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.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:28:43,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:28:43,974 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:28:43,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:28:43,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:28:43,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:28:43,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:28:43,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:28:43,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:28:43,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:28:43,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:28:43,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:28:43,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:28:43,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:28:43,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:28:44,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:28:44,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:28:44,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:28:44,006 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:28:44,007 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:28:44,010 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:28:44,010 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:28:44,010 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:28:44,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:28:44,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:28:44,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:28:44,014 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:28:44,015 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:28:44,015 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:28:44,015 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:28:44,016 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:28:44,016 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.epf [2018-01-24 15:28:44,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:28:44,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:28:44,027 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:28:44,027 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:28:44,028 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:28:44,028 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:28:44,028 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:28:44,029 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:28:44,029 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:28:44,029 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:28:44,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:28:44,029 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:28:44,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:28:44,030 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:28:44,030 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:28:44,030 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:28:44,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:28:44,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:28:44,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:28:44,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:28:44,031 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:28:44,031 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:28:44,032 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:28:44,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:28:44,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:28:44,032 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:28:44,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:28:44,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:28:44,033 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:28:44,033 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:28:44,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:28:44,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:28:44,034 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:28:44,034 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:28:44,035 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:28:44,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:28:44,082 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:28:44,086 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:28:44,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:28:44,088 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:28:44,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-01-24 15:28:44,274 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:28:44,280 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:28:44,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:28:44,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:28:44,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:28:44,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd00cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44, skipping insertion in model container [2018-01-24 15:28:44,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:28:44,349 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:28:44,470 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:28:44,491 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:28:44,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44 WrapperNode [2018-01-24 15:28:44,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:28:44,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:28:44,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:28:44,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:28:44,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (1/1) ... [2018-01-24 15:28:44,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:28:44,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:28:44,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:28:44,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:28:44,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (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 15:28:44,594 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:28:44,594 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:28:44,594 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 15:28:44,594 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 15:28:44,594 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:28:44,595 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:28:44,595 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:28:44,595 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:28:44,595 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:28:44,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:28:44,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:28:44,596 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:28:44,596 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:28:44,596 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:28:44,596 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:28:44,596 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 15:28:44,597 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 15:28:44,597 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:28:44,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:28:44,597 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:28:44,947 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:28:44,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:28:44 BoogieIcfgContainer [2018-01-24 15:28:44,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:28:44,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:28:44,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:28:44,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:28:44,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:28:44" (1/3) ... [2018-01-24 15:28:44,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b2504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:28:44, skipping insertion in model container [2018-01-24 15:28:44,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:28:44" (2/3) ... [2018-01-24 15:28:44,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b2504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:28:44, skipping insertion in model container [2018-01-24 15:28:44,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:28:44" (3/3) ... [2018-01-24 15:28:44,958 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-24 15:28:44,968 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:28:44,978 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 15:28:45,030 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:28:45,030 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:28:45,030 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:28:45,030 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:28:45,030 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:28:45,030 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:28:45,030 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:28:45,031 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:28:45,031 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:28:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 15:28:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 15:28:45,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:45,054 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:45,055 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 15:28:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 15:28:45,060 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:45,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:45,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,105 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:45,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:45,226 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 15:28:45,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:45,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:28:45,229 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:45,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 15:28:45,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 15:28:45,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 15:28:45,256 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 15:28:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:45,381 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 15:28:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 15:28:45,383 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 15:28:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:45,395 INFO L225 Difference]: With dead ends: 92 [2018-01-24 15:28:45,396 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 15:28:45,398 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 15:28:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 15:28:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 15:28:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 15:28:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 15:28:45,433 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 15:28:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:45,434 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 15:28:45,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 15:28:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 15:28:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 15:28:45,434 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:45,434 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:45,435 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 15:28:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 15:28:45,435 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:45,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:45,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:45,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:45,498 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 15:28:45,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:45,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:28:45,498 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:45,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:28:45,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:28:45,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:28:45,501 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 15:28:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:45,518 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 15:28:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:28:45,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 15:28:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:45,521 INFO L225 Difference]: With dead ends: 87 [2018-01-24 15:28:45,521 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 15:28:45,522 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 15:28:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 15:28:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 15:28:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 15:28:45,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 15:28:45,529 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 15:28:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:45,529 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 15:28:45,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:28:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 15:28:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 15:28:45,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:45,530 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:45,530 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 15:28:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 15:28:45,531 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:45,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:45,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,532 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:45,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:45,629 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 15:28:45,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:45,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:28:45,629 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:45,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:28:45,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:28:45,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:28:45,630 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 15:28:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:45,682 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 15:28:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:28:45,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 15:28:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:45,684 INFO L225 Difference]: With dead ends: 145 [2018-01-24 15:28:45,685 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 15:28:45,685 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 15:28:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 15:28:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 15:28:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 15:28:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 15:28:45,704 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 15:28:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:45,704 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 15:28:45,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:28:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 15:28:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:28:45,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:45,705 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:45,706 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 15:28:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 15:28:45,706 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:45,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:45,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,708 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:45,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:45,759 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 15:28:45,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:45,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:28:45,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:45,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:28:45,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:28:45,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:28:45,761 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 15:28:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:45,867 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 15:28:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:28:45,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 15:28:45,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:45,870 INFO L225 Difference]: With dead ends: 148 [2018-01-24 15:28:45,870 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 15:28:45,870 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 15:28:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 15:28:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 15:28:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:28:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 15:28:45,889 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 15:28:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:45,890 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 15:28:45,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:28:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 15:28:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:28:45,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:45,891 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:45,891 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 15:28:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 15:28:45,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:45,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:45,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:45,894 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:45,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:45,968 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 15:28:45,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:45,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:28:45,968 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:45,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:28:45,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:28:45,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:28:45,969 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 15:28:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:46,122 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 15:28:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:28:46,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 15:28:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:46,124 INFO L225 Difference]: With dead ends: 385 [2018-01-24 15:28:46,124 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 15:28:46,127 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 15:28:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 15:28:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 15:28:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 15:28:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 15:28:46,150 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 15:28:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:46,150 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 15:28:46,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:28:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 15:28:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:28:46,151 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:46,151 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:46,151 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 15:28:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 15:28:46,152 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:46,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:46,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:46,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:46,205 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 15:28:46,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:46,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:28:46,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:46,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:28:46,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:28:46,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:28:46,206 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 15:28:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:46,433 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 15:28:46,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:28:46,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 15:28:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:46,438 INFO L225 Difference]: With dead ends: 390 [2018-01-24 15:28:46,438 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 15:28:46,439 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 15:28:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 15:28:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 15:28:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 15:28:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 15:28:46,473 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 15:28:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:46,473 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 15:28:46,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:28:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 15:28:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:28:46,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:46,475 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:46,475 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 15:28:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 15:28:46,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:46,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:46,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,477 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:46,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:46,566 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 15:28:46,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:46,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:28:46,593 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:46,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:28:46,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:28:46,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:28:46,594 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 15:28:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:46,708 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 15:28:46,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:28:46,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 15:28:46,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:46,713 INFO L225 Difference]: With dead ends: 489 [2018-01-24 15:28:46,713 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 15:28:46,714 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 15:28:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 15:28:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 15:28:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 15:28:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 15:28:46,750 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 15:28:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:46,751 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 15:28:46,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:28:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 15:28:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:28:46,752 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:46,752 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:46,752 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 15:28:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 15:28:46,753 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:46,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:46,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,754 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:46,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:46,824 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 15:28:46,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:28:46,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:28:46,825 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:46,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:28:46,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:28:46,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:28:46,826 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 15:28:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:46,926 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 15:28:46,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:28:46,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 15:28:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:46,933 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 15:28:46,933 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 15:28:46,935 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 15:28:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 15:28:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 15:28:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 15:28:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 15:28:46,995 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 15:28:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:46,995 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 15:28:46,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:28:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 15:28:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:28:46,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:46,997 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 15:28:46,997 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 15:28:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 15:28:46,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:46,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:46,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:46,999 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:47,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:47,144 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 15:28:47,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:28:47,145 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:28:47,146 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:28:47,148 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 15:28:47,213 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:28:47,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:28:47,432 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:28:47,433 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 15:28:47,444 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:28:47,566 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 83.81% of their original sizes. [2018-01-24 15:28:47,566 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:28:47,584 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:28:47,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:28:47,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-24 15:28:47,586 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:28:47,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:28:47,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:28:47,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:28:47,587 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-01-24 15:28:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:50,051 INFO L93 Difference]: Finished difference Result 1710 states and 2487 transitions. [2018-01-24 15:28:50,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:28:50,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 15:28:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:50,056 INFO L225 Difference]: With dead ends: 1710 [2018-01-24 15:28:50,057 INFO L226 Difference]: Without dead ends: 887 [2018-01-24 15:28:50,060 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:28:50,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-01-24 15:28:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 864. [2018-01-24 15:28:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-01-24 15:28:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1256 transitions. [2018-01-24 15:28:50,123 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1256 transitions. Word has length 26 [2018-01-24 15:28:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:50,124 INFO L432 AbstractCegarLoop]: Abstraction has 864 states and 1256 transitions. [2018-01-24 15:28:50,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:28:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1256 transitions. [2018-01-24 15:28:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:28:50,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:50,125 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 15:28:50,125 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 15:28:50,125 INFO L82 PathProgramCache]: Analyzing trace with hash -938176756, now seen corresponding path program 1 times [2018-01-24 15:28:50,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:50,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:50,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:50,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:50,127 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:50,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:50,208 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 15:28:50,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:28:50,209 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:28:50,209 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:28:50,209 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 15:28:50,210 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:28:50,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:28:50,389 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:28:50,389 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 15:28:50,393 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:28:50,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:28:50,393 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 15:28:50,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:50,406 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:28:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:50,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:28:50,633 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 15:28:50,634 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:28:50,868 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 15:28:50,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:28:50,902 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 15:28:50,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:50,909 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:28:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:51,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:28:51,043 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 15:28:51,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:28:51,170 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 15:28:51,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:28:51,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 6, 6] total 15 [2018-01-24 15:28:51,174 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:28:51,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:28:51,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:28:51,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:28:51,175 INFO L87 Difference]: Start difference. First operand 864 states and 1256 transitions. Second operand 10 states. [2018-01-24 15:28:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:28:52,435 INFO L93 Difference]: Finished difference Result 2609 states and 4001 transitions. [2018-01-24 15:28:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 15:28:52,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 15:28:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:28:52,445 INFO L225 Difference]: With dead ends: 2609 [2018-01-24 15:28:52,445 INFO L226 Difference]: Without dead ends: 1786 [2018-01-24 15:28:52,448 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2018-01-24 15:28:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-01-24 15:28:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1584. [2018-01-24 15:28:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-01-24 15:28:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2296 transitions. [2018-01-24 15:28:52,525 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2296 transitions. Word has length 26 [2018-01-24 15:28:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:28:52,526 INFO L432 AbstractCegarLoop]: Abstraction has 1584 states and 2296 transitions. [2018-01-24 15:28:52,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:28:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2296 transitions. [2018-01-24 15:28:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:28:52,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:28:52,527 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:28:52,527 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:28:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-01-24 15:28:52,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:28:52,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:52,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:28:52,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:28:52,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:28:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:28:52,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:28:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:28:52,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:28:52,811 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:28:52,811 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 15:28:52,812 INFO L201 CegarAbsIntRunner]: [2], [4], [9], [13], [15], [18], [29], [33], [47], [49], [50], [53], [54], [55], [56], [59], [97], [146], [147], [151], [152], [155], [156], [157] [2018-01-24 15:28:52,813 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:28:52,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:29:15,368 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:29:15,368 INFO L268 AbstractInterpreter]: Visited 24 different actions 43 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-01-24 15:29:15,381 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:29:15,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:15,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:29:15,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:15,390 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:15,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:15,466 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:15,589 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:29:15,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 12 [2018-01-24 15:29:15,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:15,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:29:15,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:29:15,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:29:15,590 INFO L87 Difference]: Start difference. First operand 1584 states and 2296 transitions. Second operand 5 states. [2018-01-24 15:29:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:15,756 INFO L93 Difference]: Finished difference Result 3928 states and 5820 transitions. [2018-01-24 15:29:15,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:29:15,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-24 15:29:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:15,769 INFO L225 Difference]: With dead ends: 3928 [2018-01-24 15:29:15,769 INFO L226 Difference]: Without dead ends: 2340 [2018-01-24 15:29:15,775 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:29:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2018-01-24 15:29:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2322. [2018-01-24 15:29:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2018-01-24 15:29:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3482 transitions. [2018-01-24 15:29:15,918 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3482 transitions. Word has length 27 [2018-01-24 15:29:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:15,919 INFO L432 AbstractCegarLoop]: Abstraction has 2322 states and 3482 transitions. [2018-01-24 15:29:15,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:29:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3482 transitions. [2018-01-24 15:29:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:29:15,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:15,921 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:15,921 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1355764439, now seen corresponding path program 1 times [2018-01-24 15:29:15,921 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:15,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:15,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:15,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:15,922 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:15,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:16,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:29:16,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:29:16,004 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:29:16,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:29:16,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:29:16,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:29:16,005 INFO L87 Difference]: Start difference. First operand 2322 states and 3482 transitions. Second operand 7 states. [2018-01-24 15:29:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:16,252 INFO L93 Difference]: Finished difference Result 3183 states and 4598 transitions. [2018-01-24 15:29:16,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:29:16,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 15:29:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:16,286 INFO L225 Difference]: With dead ends: 3183 [2018-01-24 15:29:16,286 INFO L226 Difference]: Without dead ends: 737 [2018-01-24 15:29:16,292 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:29:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-01-24 15:29:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 678. [2018-01-24 15:29:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-01-24 15:29:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 913 transitions. [2018-01-24 15:29:16,334 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 913 transitions. Word has length 31 [2018-01-24 15:29:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:16,334 INFO L432 AbstractCegarLoop]: Abstraction has 678 states and 913 transitions. [2018-01-24 15:29:16,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:29:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 913 transitions. [2018-01-24 15:29:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 15:29:16,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:16,335 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:16,335 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:16,336 INFO L82 PathProgramCache]: Analyzing trace with hash 38071788, now seen corresponding path program 1 times [2018-01-24 15:29:16,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:16,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:16,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:16,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:16,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:16,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:16,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:16,447 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:29:16,447 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 15:29:16,448 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [105], [110], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 15:29:16,449 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:29:16,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:29:16,586 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:29:16,586 INFO L268 AbstractInterpreter]: Visited 22 different actions 47 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 15:29:16,588 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:29:16,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:16,588 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:29:16,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:16,595 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:16,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:16,763 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:16,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:16,952 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:29:16,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:16,960 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:17,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:17,114 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:17,208 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:17,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:29:17,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 13 [2018-01-24 15:29:17,211 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:29:17,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:29:17,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:29:17,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:29:17,212 INFO L87 Difference]: Start difference. First operand 678 states and 913 transitions. Second operand 10 states. [2018-01-24 15:29:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:19,035 INFO L93 Difference]: Finished difference Result 2902 states and 4079 transitions. [2018-01-24 15:29:19,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:29:19,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-24 15:29:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:19,044 INFO L225 Difference]: With dead ends: 2902 [2018-01-24 15:29:19,044 INFO L226 Difference]: Without dead ends: 2234 [2018-01-24 15:29:19,046 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 131 SyntacticMatches, 18 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2018-01-24 15:29:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2018-01-24 15:29:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1960. [2018-01-24 15:29:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2018-01-24 15:29:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2659 transitions. [2018-01-24 15:29:19,136 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2659 transitions. Word has length 38 [2018-01-24 15:29:19,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:19,137 INFO L432 AbstractCegarLoop]: Abstraction has 1960 states and 2659 transitions. [2018-01-24 15:29:19,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:29:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2659 transitions. [2018-01-24 15:29:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 15:29:19,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:19,138 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:19,138 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1056748287, now seen corresponding path program 1 times [2018-01-24 15:29:19,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:19,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:19,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:19,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:19,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:19,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:19,396 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-01-24 15:29:19,564 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 19 DAG size of output 15 [2018-01-24 15:29:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 15:29:19,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:19,652 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:29:19,652 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-24 15:29:19,653 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [15], [21], [98], [101], [102], [112], [115], [117], [120], [130], [142], [144], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 15:29:19,654 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:29:19,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:29:19,795 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:29:19,795 INFO L268 AbstractInterpreter]: Visited 24 different actions 55 times. Merged at 9 different actions 13 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 39 variables. [2018-01-24 15:29:19,801 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:29:19,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:19,801 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:29:19,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:19,816 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:19,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 15:29:20,173 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:20,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:20,413 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:29:20,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:20,420 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:20,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:20,683 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:29:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:29:20,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:29:20,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11, 8, 8] total 29 [2018-01-24 15:29:20,902 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:29:20,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 15:29:20,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 15:29:20,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-01-24 15:29:20,903 INFO L87 Difference]: Start difference. First operand 1960 states and 2659 transitions. Second operand 16 states. [2018-01-24 15:29:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:29:21,975 INFO L93 Difference]: Finished difference Result 3291 states and 4395 transitions. [2018-01-24 15:29:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-24 15:29:21,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-24 15:29:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:29:21,983 INFO L225 Difference]: With dead ends: 3291 [2018-01-24 15:29:21,983 INFO L226 Difference]: Without dead ends: 1287 [2018-01-24 15:29:21,990 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=525, Invalid=2555, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 15:29:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-01-24 15:29:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1213. [2018-01-24 15:29:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-01-24 15:29:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1523 transitions. [2018-01-24 15:29:22,070 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1523 transitions. Word has length 41 [2018-01-24 15:29:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:29:22,070 INFO L432 AbstractCegarLoop]: Abstraction has 1213 states and 1523 transitions. [2018-01-24 15:29:22,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 15:29:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1523 transitions. [2018-01-24 15:29:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 15:29:22,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:29:22,072 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:29:22,072 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 15:29:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -729807276, now seen corresponding path program 1 times [2018-01-24 15:29:22,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:29:22,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:22,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:22,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:29:22,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:29:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:22,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:29:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 15:29:22,283 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:22,283 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:29:22,284 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-01-24 15:29:22,284 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [9], [13], [15], [18], [21], [29], [33], [47], [49], [50], [53], [54], [55], [56], [59], [62], [69], [73], [80], [90], [93], [97], [98], [101], [102], [105], [108], [145], [146], [147], [151], [152], [153], [154], [155], [156], [157] [2018-01-24 15:29:22,285 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:29:22,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 15:29:27,494 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 15:29:27,495 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 15:29:27,495 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:29:27,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:29:27,495 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:29:27,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:29:27,502 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:29:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:29:27,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:29:27,554 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:29:27,554 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:29:27,559 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:29:27,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:29:27 BoogieIcfgContainer [2018-01-24 15:29:27,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:29:27,560 INFO L168 Benchmark]: Toolchain (without parser) took 43285.62 ms. Allocated memory was 300.9 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 260.0 MB in the beginning and 771.0 MB in the end (delta: -511.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 15:29:27,561 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 300.9 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:29:27,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.61 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 247.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:29:27,561 INFO L168 Benchmark]: Boogie Preprocessor took 38.65 ms. Allocated memory is still 300.9 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:29:27,562 INFO L168 Benchmark]: RCFGBuilder took 407.25 ms. Allocated memory is still 300.9 MB. Free memory was 245.9 MB in the beginning and 221.3 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:29:27,562 INFO L168 Benchmark]: TraceAbstraction took 42609.42 ms. Allocated memory was 300.9 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 221.3 MB in the beginning and 771.0 MB in the end (delta: -549.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 15:29:27,564 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 300.9 MB. Free memory is still 266.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.61 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 247.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.65 ms. Allocated memory is still 300.9 MB. Free memory was 247.9 MB in the beginning and 245.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 407.25 ms. Allocated memory is still 300.9 MB. Free memory was 245.9 MB in the beginning and 221.3 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42609.42 ms. Allocated memory was 300.9 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 221.3 MB in the beginning and 771.0 MB in the end (delta: -549.7 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 : 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 : 92 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 14 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.879012 RENAME_VARIABLES(MILLISECONDS) : 0.246005 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.821472 PROJECTAWAY(MILLISECONDS) : 0.054191 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.528887 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.297192 ADD_EQUALITY(MILLISECONDS) : 0.097921 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014807 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 25 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 24 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 91 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - 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 : 140 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.653343 RENAME_VARIABLES(MILLISECONDS) : 0.110450 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.622453 PROJECTAWAY(MILLISECONDS) : 0.090156 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.251615 DISJOIN(MILLISECONDS) : 0.204555 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.134669 ADD_EQUALITY(MILLISECONDS) : 0.019326 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024046 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 175 #UNFREEZE : 0 #CONJOIN : 253 #PROJECTAWAY : 111 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 24 #RENAME_VARIABLES_DISJUNCTIVE : 155 #ADD_EQUALITY : 138 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 20 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 535 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 162 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 316.107246 RENAME_VARIABLES(MILLISECONDS) : 0.003972 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 315.370535 PROJECTAWAY(MILLISECONDS) : 2791.368930 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.043526 DISJOIN(MILLISECONDS) : 0.144356 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.010304 ADD_EQUALITY(MILLISECONDS) : 0.020646 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009020 #CONJOIN_DISJUNCTIVE : 82 #RENAME_VARIABLES : 158 #UNFREEZE : 0 #CONJOIN : 265 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 29 #RENAME_VARIABLES_DISJUNCTIVE : 146 #ADD_EQUALITY : 167 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 436 LocStat_NO_SUPPORTING_DISEQUALITIES : 3 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 141 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.523235 RENAME_VARIABLES(MILLISECONDS) : 0.084341 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.498804 PROJECTAWAY(MILLISECONDS) : 0.049084 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.098439 DISJOIN(MILLISECONDS) : 0.159848 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.105177 ADD_EQUALITY(MILLISECONDS) : 0.014960 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014103 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 189 #UNFREEZE : 0 #CONJOIN : 261 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 167 #ADD_EQUALITY : 139 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 483 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 151 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.311808 RENAME_VARIABLES(MILLISECONDS) : 0.004493 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.108863 PROJECTAWAY(MILLISECONDS) : 0.498898 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.119520 DISJOIN(MILLISECONDS) : 0.185820 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.011627 ADD_EQUALITY(MILLISECONDS) : 0.023869 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005324 #CONJOIN_DISJUNCTIVE : 115 #RENAME_VARIABLES : 249 #UNFREEZE : 0 #CONJOIN : 323 #PROJECTAWAY : 161 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 35 #RENAME_VARIABLES_DISJUNCTIVE : 221 #ADD_EQUALITY : 151 #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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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 65 with TraceHistMax 5, 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, 42.5s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1363 SDtfs, 2435 SDslu, 2422 SDs, 0 SdLazy, 1708 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 648 GetRequests, 483 SyntacticMatches, 24 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2322occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 28.5s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.44 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 791 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 744 ConstructedInterpolants, 0 QuantifiedInterpolants, 93185 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 252/344 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.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_15-29-27-581.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-29-27-581.csv Completed graceful shutdown