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/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:39:59,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:39:59,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:39:59,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:39:59,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:39:59,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:39:59,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:39:59,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:39:59,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:39:59,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:39:59,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:39:59,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:39:59,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:39:59,046 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:39:59,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:39:59,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:39:59,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:39:59,054 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:39:59,055 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:39:59,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:39:59,059 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:39:59,059 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:39:59,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:39:59,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:39:59,061 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:39:59,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:39:59,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:39:59,064 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:39:59,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:39:59,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:39:59,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:39:59,065 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:39:59,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:39:59,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:39:59,074 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:39:59,075 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:39:59,075 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:39:59,075 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:39:59,075 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:39:59,075 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:39:59,076 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:39:59,077 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:39:59,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:39:59,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:39:59,077 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:39:59,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:39:59,077 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:39:59,077 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:39:59,078 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:39:59,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:39:59,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:39:59,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:39:59,078 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:39:59,079 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:39:59,080 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:39:59,080 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:39:59,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:39:59,125 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:39:59,128 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:39:59,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:39:59,129 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:39:59,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-01-20 23:39:59,316 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:39:59,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:39:59,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:39:59,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:39:59,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:39:59,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44478139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59, skipping insertion in model container [2018-01-20 23:39:59,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,346 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:39:59,388 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:39:59,512 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:39:59,538 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:39:59,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59 WrapperNode [2018-01-20 23:39:59,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:39:59,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:39:59,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:39:59,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:39:59,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (1/1) ... [2018-01-20 23:39:59,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:39:59,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:39:59,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:39:59,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:39:59,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (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-20 23:39:59,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:39:59,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:39:59,664 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-20 23:39:59,664 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-20 23:39:59,665 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 23:39:59,665 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:39:59,665 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:39:59,665 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:39:59,665 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:39:59,665 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:39:59,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-20 23:39:59,666 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-20 23:39:59,667 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 23:39:59,667 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:39:59,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:39:59,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:40:00,142 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:40:00,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:40:00 BoogieIcfgContainer [2018-01-20 23:40:00,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:40:00,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:40:00,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:40:00,147 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:40:00,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:39:59" (1/3) ... [2018-01-20 23:40:00,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597ff73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:40:00, skipping insertion in model container [2018-01-20 23:40:00,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:39:59" (2/3) ... [2018-01-20 23:40:00,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597ff73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:40:00, skipping insertion in model container [2018-01-20 23:40:00,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:40:00" (3/3) ... [2018-01-20 23:40:00,151 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-01-20 23:40:00,161 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:40:00,169 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-20 23:40:00,210 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:40:00,210 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:40:00,210 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:40:00,211 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:40:00,211 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:40:00,211 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:40:00,211 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:40:00,211 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-20 23:40:00,212 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:40:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-20 23:40:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:40:00,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:00,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:00,235 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash 187522691, now seen corresponding path program 1 times [2018-01-20 23:40:00,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:00,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:00,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,286 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:00,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:00,456 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-20 23:40:00,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:00,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:00,458 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:00,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:00,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:00,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:00,543 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2018-01-20 23:40:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:00,587 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2018-01-20 23:40:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:00,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 23:40:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:00,597 INFO L225 Difference]: With dead ends: 252 [2018-01-20 23:40:00,597 INFO L226 Difference]: Without dead ends: 98 [2018-01-20 23:40:00,602 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-20 23:40:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-20 23:40:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-20 23:40:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-20 23:40:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-01-20 23:40:00,640 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 25 [2018-01-20 23:40:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:00,641 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-01-20 23:40:00,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-01-20 23:40:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:40:00,643 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:00,643 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:00,643 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 358615040, now seen corresponding path program 1 times [2018-01-20 23:40:00,644 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:00,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:00,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,645 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:00,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:00,742 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-20 23:40:00,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:00,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:00,743 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:00,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:00,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:00,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:00,745 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2018-01-20 23:40:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:00,784 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2018-01-20 23:40:00,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:40:00,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-20 23:40:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:00,786 INFO L225 Difference]: With dead ends: 240 [2018-01-20 23:40:00,786 INFO L226 Difference]: Without dead ends: 150 [2018-01-20 23:40:00,788 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 23:40:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-20 23:40:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-01-20 23:40:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-20 23:40:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2018-01-20 23:40:00,798 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 27 [2018-01-20 23:40:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:00,798 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2018-01-20 23:40:00,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:40:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2018-01-20 23:40:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:40:00,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:00,799 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:00,799 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1671536572, now seen corresponding path program 1 times [2018-01-20 23:40:00,799 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:00,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:00,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,800 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:00,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:00,850 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-20 23:40:00,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:00,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:40:00,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:00,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:00,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:00,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:00,852 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 3 states. [2018-01-20 23:40:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:00,936 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2018-01-20 23:40:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:00,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-20 23:40:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:00,972 INFO L225 Difference]: With dead ends: 151 [2018-01-20 23:40:00,972 INFO L226 Difference]: Without dead ends: 150 [2018-01-20 23:40:00,973 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-20 23:40:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-20 23:40:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-20 23:40:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-20 23:40:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-01-20 23:40:00,984 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 29 [2018-01-20 23:40:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:00,985 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-01-20 23:40:00,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-01-20 23:40:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 23:40:00,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:00,986 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 23:40:00,986 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:00,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1893588353, now seen corresponding path program 1 times [2018-01-20 23:40:00,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:00,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:00,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:00,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:01,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:01,060 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-20 23:40:01,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:01,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:01,061 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:01,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:01,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:01,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:01,062 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 3 states. [2018-01-20 23:40:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:01,100 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-01-20 23:40:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:01,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-20 23:40:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:01,102 INFO L225 Difference]: With dead ends: 306 [2018-01-20 23:40:01,102 INFO L226 Difference]: Without dead ends: 164 [2018-01-20 23:40:01,103 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-20 23:40:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-20 23:40:01,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2018-01-20 23:40:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-20 23:40:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-01-20 23:40:01,116 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 44 [2018-01-20 23:40:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:01,117 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-01-20 23:40:01,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-01-20 23:40:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 23:40:01,119 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:01,119 INFO L322 BasicCegarLoop]: trace histogram [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, 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-20 23:40:01,119 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash 178943670, now seen corresponding path program 1 times [2018-01-20 23:40:01,120 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:01,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:01,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:01,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:01,121 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:01,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:01,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:40:01,204 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:40:01,205 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-01-20 23:40:01,207 INFO L201 CegarAbsIntRunner]: [0], [7], [14], [15], [16], [17], [18], [19], [23], [26], [28], [29], [30], [31], [32], [34], [38], [39], [43], [45], [52], [54], [61], [65], [75], [76], [80], [82], [85], [103], [105], [106], [107], [108], [112], [180], [181], [187], [188], [189], [190], [191], [192], [193], [196], [211], [215], [216], [217], [219] [2018-01-20 23:40:01,258 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-20 23:40:01,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-20 23:40:57,055 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-20 23:40:57,056 INFO L268 AbstractInterpreter]: Visited 50 different actions 73 times. Merged at 23 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 41 variables. [2018-01-20 23:40:57,063 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-20 23:40:57,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:40:57,064 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-20 23:40:57,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:57,075 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:40:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:57,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:40:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,133 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:40:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:40:57,198 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-20 23:40:57,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:57,202 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-20 23:40:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:57,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:40:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,269 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:40:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:40:57,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 6 [2018-01-20 23:40:57,334 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:40:57,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:40:57,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:40:57,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:40:57,335 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 5 states. [2018-01-20 23:40:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:57,414 INFO L93 Difference]: Finished difference Result 324 states and 361 transitions. [2018-01-20 23:40:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:57,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-20 23:40:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:57,416 INFO L225 Difference]: With dead ends: 324 [2018-01-20 23:40:57,417 INFO L226 Difference]: Without dead ends: 178 [2018-01-20 23:40:57,418 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:40:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-20 23:40:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-01-20 23:40:57,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-20 23:40:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-01-20 23:40:57,429 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 51 [2018-01-20 23:40:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:57,430 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-01-20 23:40:57,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:40:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-01-20 23:40:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 23:40:57,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:57,432 INFO L322 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:57,432 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash 977028767, now seen corresponding path program 2 times [2018-01-20 23:40:57,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:57,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:57,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:57,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:57,434 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:57,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:40:57,549 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-20 23:40:57,549 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-20 23:40:57,549 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-20 23:40:57,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:40:57,549 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-20 23:40:57,567 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:40:57,568 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:40:57,594 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:40:57,615 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:40:57,622 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:40:57,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:40:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,707 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:40:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 23:40:57,773 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-20 23:40:57,777 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 23:40:57,778 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-20 23:40:57,810 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:40:57,946 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 23:40:57,964 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 23:40:57,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 23:40:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:57,976 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-20 23:40:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:40:58,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-20 23:40:58,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 6 [2018-01-20 23:40:58,028 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-20 23:40:58,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:40:58,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:40:58,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:40:58,030 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 6 states. [2018-01-20 23:40:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,084 INFO L93 Difference]: Finished difference Result 342 states and 379 transitions. [2018-01-20 23:40:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:40:58,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-20 23:40:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,085 INFO L225 Difference]: With dead ends: 342 [2018-01-20 23:40:58,085 INFO L226 Difference]: Without dead ends: 182 [2018-01-20 23:40:58,086 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:40:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-20 23:40:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-20 23:40:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-20 23:40:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2018-01-20 23:40:58,095 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 58 [2018-01-20 23:40:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,095 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2018-01-20 23:40:58,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:40:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2018-01-20 23:40:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-20 23:40:58,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,097 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,097 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0EnsuresViolation]=== [2018-01-20 23:40:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 885354134, now seen corresponding path program 3 times [2018-01-20 23:40:58,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,098 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 23:40:58,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:40:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:40:58,219 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:40:58,239 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:40:58,253 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:40:58,278 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:40:58,278 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:40:58,278 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:40:58,278 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:40:58,278 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:40:58,278 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:40:58,278 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:40:58,278 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-20 23:40:58,279 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:40:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-20 23:40:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:40:58,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,282 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,282 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:40:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash 631302393, now seen corresponding path program 1 times [2018-01-20 23:40:58,282 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,283 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,294 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-20 23:40:58,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:40:58,295 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:40:58,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:40:58,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:40:58,296 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-20 23:40:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,303 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-20 23:40:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:40:58,303 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-20 23:40:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,305 INFO L225 Difference]: With dead ends: 251 [2018-01-20 23:40:58,305 INFO L226 Difference]: Without dead ends: 118 [2018-01-20 23:40:58,306 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-20 23:40:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-20 23:40:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-20 23:40:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-20 23:40:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-01-20 23:40:58,312 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 24 [2018-01-20 23:40:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,312 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-01-20 23:40:58,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:40:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-01-20 23:40:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-20 23:40:58,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,314 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,314 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:40:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash -60214454, now seen corresponding path program 1 times [2018-01-20 23:40:58,314 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,316 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,345 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-20 23:40:58,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:58,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:58,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:58,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:58,346 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 3 states. [2018-01-20 23:40:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,359 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2018-01-20 23:40:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:58,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-20 23:40:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,361 INFO L225 Difference]: With dead ends: 229 [2018-01-20 23:40:58,361 INFO L226 Difference]: Without dead ends: 119 [2018-01-20 23:40:58,362 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-20 23:40:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-20 23:40:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-20 23:40:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-20 23:40:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-20 23:40:58,367 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 54 [2018-01-20 23:40:58,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,367 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-20 23:40:58,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-20 23:40:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 23:40:58,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,369 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,369 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:40:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 152237805, now seen corresponding path program 1 times [2018-01-20 23:40:58,369 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,370 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,425 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-20 23:40:58,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:58,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:58,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:58,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,426 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 4 states. [2018-01-20 23:40:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,451 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-01-20 23:40:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:58,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-20 23:40:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,456 INFO L225 Difference]: With dead ends: 278 [2018-01-20 23:40:58,456 INFO L226 Difference]: Without dead ends: 167 [2018-01-20 23:40:58,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-20 23:40:58,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-01-20 23:40:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-20 23:40:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-01-20 23:40:58,466 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 56 [2018-01-20 23:40:58,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,467 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-01-20 23:40:58,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:40:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-01-20 23:40:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 23:40:58,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,469 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,469 INFO L371 AbstractCegarLoop]: === Iteration 4 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:40:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash -536266093, now seen corresponding path program 1 times [2018-01-20 23:40:58,469 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,506 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-20 23:40:58,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:58,507 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:58,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:58,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:58,508 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 3 states. [2018-01-20 23:40:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,518 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-01-20 23:40:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:58,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-20 23:40:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,521 INFO L225 Difference]: With dead ends: 190 [2018-01-20 23:40:58,521 INFO L226 Difference]: Without dead ends: 168 [2018-01-20 23:40:58,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-20 23:40:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-20 23:40:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-01-20 23:40:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-20 23:40:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2018-01-20 23:40:58,529 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 58 [2018-01-20 23:40:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,530 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2018-01-20 23:40:58,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2018-01-20 23:40:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 23:40:58,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,532 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,532 INFO L371 AbstractCegarLoop]: === Iteration 5 === [freeDataErr0EnsuresViolation]=== [2018-01-20 23:40:58,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2124613995, now seen corresponding path program 1 times [2018-01-20 23:40:58,532 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,603 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-20 23:40:58,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:58,604 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:58,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:58,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,605 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand 4 states. [2018-01-20 23:40:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,650 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2018-01-20 23:40:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:58,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-20 23:40:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,652 INFO L225 Difference]: With dead ends: 293 [2018-01-20 23:40:58,652 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:40:58,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:40:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:40:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:40:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:40:58,654 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-20 23:40:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,654 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:40:58,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:40:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:40:58,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:40:58,657 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:40:58,658 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:40:58,658 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:40:58,658 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:40:58,658 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:40:58,658 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:40:58,658 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:40:58,658 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:40:58,658 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:40:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-20 23:40:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:40:58,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,660 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:40:58,660 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:40:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 242168, now seen corresponding path program 1 times [2018-01-20 23:40:58,661 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:40:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:40:58,667 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:40:58,668 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:40:58,670 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:40:58,670 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:40:58,670 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:40:58,670 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:40:58,670 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:40:58,670 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:40:58,671 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:40:58,671 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:40:58,671 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:40:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-20 23:40:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 23:40:58,673 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,673 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,673 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:40:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash -920378739, now seen corresponding path program 1 times [2018-01-20 23:40:58,674 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,675 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,683 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-20 23:40:58,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:40:58,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:40:58,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:40:58,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:40:58,684 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-20 23:40:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,691 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-20 23:40:58,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:40:58,691 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-20 23:40:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,692 INFO L225 Difference]: With dead ends: 251 [2018-01-20 23:40:58,692 INFO L226 Difference]: Without dead ends: 124 [2018-01-20 23:40:58,693 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-20 23:40:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-20 23:40:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-20 23:40:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-20 23:40:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-20 23:40:58,699 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 16 [2018-01-20 23:40:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,699 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-20 23:40:58,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:40:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-20 23:40:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 23:40:58,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,700 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2018-01-20 23:40:58,700 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:40:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1643632883, now seen corresponding path program 1 times [2018-01-20 23:40:58,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,726 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-20 23:40:58,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:58,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:58,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:58,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:58,728 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 3 states. [2018-01-20 23:40:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,742 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-01-20 23:40:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:58,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-20 23:40:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,743 INFO L225 Difference]: With dead ends: 241 [2018-01-20 23:40:58,743 INFO L226 Difference]: Without dead ends: 125 [2018-01-20 23:40:58,744 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-20 23:40:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-20 23:40:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-20 23:40:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-20 23:40:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-20 23:40:58,750 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 48 [2018-01-20 23:40:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,750 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-20 23:40:58,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-20 23:40:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 23:40:58,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,751 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,751 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:40:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1336549616, now seen corresponding path program 1 times [2018-01-20 23:40:58,752 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,753 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,800 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-20 23:40:58,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:58,800 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:58,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:58,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,802 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 4 states. [2018-01-20 23:40:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,821 INFO L93 Difference]: Finished difference Result 290 states and 321 transitions. [2018-01-20 23:40:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:58,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-20 23:40:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,823 INFO L225 Difference]: With dead ends: 290 [2018-01-20 23:40:58,823 INFO L226 Difference]: Without dead ends: 173 [2018-01-20 23:40:58,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-20 23:40:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-20 23:40:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-20 23:40:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-01-20 23:40:58,832 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 50 [2018-01-20 23:40:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,832 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-01-20 23:40:58,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:40:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-01-20 23:40:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 23:40:58,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,833 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,834 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:40:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash 518887702, now seen corresponding path program 1 times [2018-01-20 23:40:58,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,835 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,865 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-20 23:40:58,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:58,866 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:58,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:58,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:58,867 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 3 states. [2018-01-20 23:40:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,877 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-01-20 23:40:58,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:58,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-20 23:40:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,879 INFO L225 Difference]: With dead ends: 202 [2018-01-20 23:40:58,879 INFO L226 Difference]: Without dead ends: 174 [2018-01-20 23:40:58,879 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-20 23:40:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-20 23:40:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-20 23:40:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-20 23:40:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-01-20 23:40:58,887 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 52 [2018-01-20 23:40:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,887 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-01-20 23:40:58,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-01-20 23:40:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-20 23:40:58,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:58,889 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:58,889 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:40:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1219952280, now seen corresponding path program 1 times [2018-01-20 23:40:58,889 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:58,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:58,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:58,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:58,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:58,934 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-20 23:40:58,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:58,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:58,934 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:58,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:58,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:58,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,935 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 4 states. [2018-01-20 23:40:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:58,994 INFO L93 Difference]: Finished difference Result 299 states and 331 transitions. [2018-01-20 23:40:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:58,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-20 23:40:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:58,995 INFO L225 Difference]: With dead ends: 299 [2018-01-20 23:40:58,995 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:40:58,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:40:58,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:40:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:40:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:40:58,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-01-20 23:40:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:58,997 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:40:58,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:40:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:40:58,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:40:58,999 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:40:58,999 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:40:58,999 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:40:59,000 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:40:59,000 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:40:59,000 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:40:59,000 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:40:59,000 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:40:59,000 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:40:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-20 23:40:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 23:40:59,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:59,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:40:59,002 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:40:59,002 INFO L82 PathProgramCache]: Analyzing trace with hash -9896274, now seen corresponding path program 1 times [2018-01-20 23:40:59,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:59,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:59,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:59,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:59,010 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-20 23:40:59,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:59,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:40:59,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:59,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:40:59,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:40:59,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:40:59,011 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-20 23:40:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:59,017 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-20 23:40:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:40:59,017 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-20 23:40:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:59,018 INFO L225 Difference]: With dead ends: 251 [2018-01-20 23:40:59,018 INFO L226 Difference]: Without dead ends: 122 [2018-01-20 23:40:59,019 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-20 23:40:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-20 23:40:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-20 23:40:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-20 23:40:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-01-20 23:40:59,024 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 14 [2018-01-20 23:40:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:59,024 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-01-20 23:40:59,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:40:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-01-20 23:40:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 23:40:59,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:59,026 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2018-01-20 23:40:59,026 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:40:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash 780411694, now seen corresponding path program 1 times [2018-01-20 23:40:59,026 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:59,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:59,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,027 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:59,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:59,048 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-20 23:40:59,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:59,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:59,048 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:59,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:59,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:59,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:59,049 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 3 states. [2018-01-20 23:40:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:59,061 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-01-20 23:40:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:59,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-20 23:40:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:59,063 INFO L225 Difference]: With dead ends: 237 [2018-01-20 23:40:59,063 INFO L226 Difference]: Without dead ends: 123 [2018-01-20 23:40:59,064 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-20 23:40:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-20 23:40:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-20 23:40:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-20 23:40:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-01-20 23:40:59,070 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 46 [2018-01-20 23:40:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:59,070 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-01-20 23:40:59,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-01-20 23:40:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 23:40:59,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:59,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2018-01-20 23:40:59,071 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:40:59,071 INFO L82 PathProgramCache]: Analyzing trace with hash -820954671, now seen corresponding path program 1 times [2018-01-20 23:40:59,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:59,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:59,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:59,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:59,114 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-20 23:40:59,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:59,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:59,114 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:59,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:59,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:59,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:59,115 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 4 states. [2018-01-20 23:40:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:59,136 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-01-20 23:40:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:59,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-20 23:40:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:59,138 INFO L225 Difference]: With dead ends: 286 [2018-01-20 23:40:59,138 INFO L226 Difference]: Without dead ends: 171 [2018-01-20 23:40:59,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-20 23:40:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-01-20 23:40:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-20 23:40:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-01-20 23:40:59,147 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 48 [2018-01-20 23:40:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:59,147 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-01-20 23:40:59,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:40:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-01-20 23:40:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 23:40:59,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:59,149 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2018-01-20 23:40:59,149 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 23:40:59,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1560314743, now seen corresponding path program 1 times [2018-01-20 23:40:59,149 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:59,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:59,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,150 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:59,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:59,181 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-20 23:40:59,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:59,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:40:59,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:59,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:40:59,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:40:59,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:40:59,182 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 3 states. [2018-01-20 23:40:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:40:59,193 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2018-01-20 23:40:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:40:59,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-20 23:40:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:40:59,195 INFO L225 Difference]: With dead ends: 198 [2018-01-20 23:40:59,195 INFO L226 Difference]: Without dead ends: 172 [2018-01-20 23:40:59,196 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-20 23:40:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-20 23:40:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-20 23:40:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-20 23:40:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-01-20 23:40:59,203 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 50 [2018-01-20 23:40:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:40:59,203 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-01-20 23:40:59,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:40:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-01-20 23:40:59,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-20 23:40:59,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:40:59,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2018-01-20 23:40:59,205 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 23:40:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594183, now seen corresponding path program 1 times [2018-01-20 23:40:59,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:40:59,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:40:59,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:40:59,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:40:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:40:59,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:40:59,248 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-20 23:40:59,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:40:59,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:40:59,248 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:40:59,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:40:59,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:40:59,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:40:59,249 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 4 states. Received shutdown request... [2018-01-20 23:40:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:40:59,286 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 23:40:59,291 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:40:59,291 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:40:59,291 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:40:59,291 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:40:59,291 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:40:59,291 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:40:59,291 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:40:59,291 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 23:40:59,292 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:40:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-20 23:40:59,293 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 23:40:59,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:40:59 BoogieIcfgContainer [2018-01-20 23:40:59,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:40:59,295 INFO L168 Benchmark]: Toolchain (without parser) took 59978.55 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.1 MB in the beginning and 812.9 MB in the end (delta: -545.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-20 23:40:59,296 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:40:59,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.49 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 255.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:40:59,297 INFO L168 Benchmark]: Boogie Preprocessor took 51.71 ms. Allocated memory is still 307.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:40:59,297 INFO L168 Benchmark]: RCFGBuilder took 543.45 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 216.8 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. [2018-01-20 23:40:59,297 INFO L168 Benchmark]: TraceAbstraction took 59149.83 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 216.8 MB in the beginning and 812.9 MB in the end (delta: -596.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-01-20 23:40:59,299 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.22 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.49 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 255.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.71 ms. Allocated memory is still 307.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 543.45 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 216.8 MB in the end (delta: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59149.83 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 216.8 MB in the beginning and 812.9 MB in the end (delta: -596.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 49 LocStat_MAX_WEQGRAPH_SIZE : 24 LocStat_MAX_SIZEOF_WEQEDGELABEL : 8 LocStat_NO_SUPPORTING_EQUALITIES : 913 LocStat_NO_SUPPORTING_DISEQUALITIES : 282 LocStat_NO_DISJUNCTIONS : -98 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 58 TransStat_MAX_WEQGRAPH_SIZE : 14 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 118 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 64 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1441.709291 RENAME_VARIABLES(MILLISECONDS) : 211.496169 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1441.633861 PROJECTAWAY(MILLISECONDS) : 0.190132 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029162 DISJOIN(MILLISECONDS) : 34.385992 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 211.568085 ADD_EQUALITY(MILLISECONDS) : 0.010058 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012739 #CONJOIN_DISJUNCTIVE : 118 #RENAME_VARIABLES : 175 #UNFREEZE : 0 #CONJOIN : 212 #PROJECTAWAY : 150 #ADD_WEAK_EQUALITY : 51 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 165 #ADD_EQUALITY : 144 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 540]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L586] FCALL struct node_t *list = ((void *)0); VAL [list={98:0}] [L587] int dataNotFinished = 0; VAL [dataNotFinished=0, list={98:0}] [L589] CALL append(&list) VAL [pointerToList={98:0}] [L576] EXPR, FCALL malloc(sizeof *node) VAL [malloc(sizeof *node)={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L576] struct node_t *node = malloc(sizeof *node); VAL [malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L577] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L577] FCALL node->next = *pointerToList VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L578] EXPR, FCALL \read(**pointerToList) VAL [\read(**pointerToList)={0:0}, malloc(sizeof *node)={85:0}, node={85:0}, pointerToList={98:0}, pointerToList={98:0}] [L578] COND TRUE *pointerToList == ((void *)0) [L579] CALL create_data(((void *)0)) VAL [prevData={0:0}] [L541] prevData != ((void *)0) && prevData->hasNextPartReference VAL [prevData={0:0}, prevData={0:0}, prevData != ((void *)0) && prevData->hasNextPartReference=0] [L541] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L544] EXPR, FCALL malloc(sizeof *data) VAL [malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L544] Data data = malloc(sizeof *data); VAL [data={91:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L545] EXPR, FCALL malloc(20 * sizeof(data->array)) VAL [data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L545] FCALL data->array = (int*) malloc(20 * sizeof(data->array)) VAL [data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L546] int counter = 0; [L547] counter = 0 VAL [counter=0, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=0, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=0, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=0, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=1, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=1, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=1, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=1, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=2, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND TRUE counter < 3 VAL [counter=2, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] EXPR, FCALL data->array VAL [counter=2, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L548] FCALL data->array[counter] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, counter=2, data={91:0}, data->array={95:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] counter++ VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L547] COND FALSE !(counter < 3) VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L550] FCALL data->number = 0 VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}] [L551] int userInput = __VERIFIER_nondet_int(); [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int() && data->number < 200=0, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L552] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int() && data->number < 200=0, __VERIFIER_nondet_int() && data->number < 200 && data->number > -200=0, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L552] COND FALSE !(__VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200) [L556] FCALL data->hasNextPartReference = 0 VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L557] FCALL data->nextData = ((void *)0) VAL [counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] [L558] COND FALSE !(__VERIFIER_nondet_int()) [L569] return data; VAL [\result={91:0}, counter=3, data={91:0}, malloc(20 * sizeof(data->array))={95:0}, malloc(sizeof *data)={91:0}, prevData={0:0}, prevData={0:0}, userInput=200] - StatisticsResult: Ultimate Automizer benchmark data for error location: create_dataErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. UNSAFE Result, 58.0s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 665 SDtfs, 90 SDslu, 1044 SDs, 0 SdLazy, 73 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 432 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 55.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 656 ConstructedInterpolants, 0 QuantifiedInterpolants, 47076 SizeOfPredicates, 4 NumberOfNonLiveVariables, 748 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 0/65 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 571]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: freeDataErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 661 SDtfs, 69 SDslu, 607 SDs, 0 SdLazy, 53 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 20021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. SAFE Result, 0.3s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 679 SDtfs, 121 SDslu, 507 SDs, 0 SdLazy, 49 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 16429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (172states) and interpolant automaton (currently 4 states, 4 states before enhancement), while ReachableStatesComputation was computing reachable states (20 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. TIMEOUT Result, 0.2s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 607 SDtfs, 116 SDslu, 390 SDs, 0 SdLazy, 35 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 15341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 575). Cancelled while IsEmpty was searching accepting run (input had 130 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-40-59-311.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-40-59-311.csv Completed graceful shutdown