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_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:22:16,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:22:16,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:22:16,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:22:16,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:22:16,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:22:16,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:22:16,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:22:16,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:22:16,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:22:16,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:22:16,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:22:16,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:22:16,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:22:16,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:22:16,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:22:16,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:22:16,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:22:16,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:22:16,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:22:16,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:22:16,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:22:16,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:22:16,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:22:16,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:22:16,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:22:16,247 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:22:16,247 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:22:16,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:22:16,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:22:16,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:22:16,248 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_smtcomp.epf [2018-01-21 10:22:16,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:22:16,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:22:16,260 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:22:16,260 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:22:16,260 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:22:16,260 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:22:16,261 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:22:16,261 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:22:16,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:22:16,262 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:22:16,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:22:16,262 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:22:16,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:22:16,263 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:22:16,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:22:16,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:22:16,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:22:16,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:22:16,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:22:16,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:22:16,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:22:16,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:22:16,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:22:16,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:22:16,265 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:22:16,265 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:22:16,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:22:16,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:22:16,266 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:22:16,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:22:16,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:22:16,266 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:22:16,266 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:22:16,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:22:16,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:22:16,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:22:16,267 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:22:16,268 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:22:16,268 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:22:16,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:22:16,315 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:22:16,319 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:22:16,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:22:16,321 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:22:16,322 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-21 10:22:16,489 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:22:16,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:22:16,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:22:16,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:22:16,520 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:22:16,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eeba7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16, skipping insertion in model container [2018-01-21 10:22:16,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,537 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:22:16,574 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:22:16,691 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:22:16,714 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:22:16,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16 WrapperNode [2018-01-21 10:22:16,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:22:16,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:22:16,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:22:16,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:22:16,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (1/1) ... [2018-01-21 10:22:16,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:22:16,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:22:16,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:22:16,766 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:22:16,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (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-21 10:22:16,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:22:16,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:22:16,815 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-21 10:22:16,816 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-21 10:22:16,816 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 10:22:16,816 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:22:16,816 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:22:16,817 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:22:17,361 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:22:17,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:22:17 BoogieIcfgContainer [2018-01-21 10:22:17,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:22:17,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:22:17,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:22:17,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:22:17,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:22:16" (1/3) ... [2018-01-21 10:22:17,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c636ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:22:17, skipping insertion in model container [2018-01-21 10:22:17,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:22:16" (2/3) ... [2018-01-21 10:22:17,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c636ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:22:17, skipping insertion in model container [2018-01-21 10:22:17,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:22:17" (3/3) ... [2018-01-21 10:22:17,371 INFO L105 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-01-21 10:22:17,381 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:22:17,393 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-21 10:22:17,445 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:22:17,445 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:22:17,445 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:22:17,445 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:22:17,445 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:22:17,446 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:22:17,446 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:22:17,446 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == create_dataErr0EnsuresViolation======== [2018-01-21 10:22:17,447 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:22:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-21 10:22:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:22:17,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:22:17,480 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-21 10:22:17,480 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:22:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 187522691, now seen corresponding path program 1 times [2018-01-21 10:22:17,488 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:22:17,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:17,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:22:17,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:17,547 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:22:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:22:17,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:22:17,716 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-21 10:22:17,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:22:17,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:22:17,720 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:22:17,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:22:17,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:22:17,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:22:17,821 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2018-01-21 10:22:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:22:17,887 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2018-01-21 10:22:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:22:17,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 10:22:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:22:17,899 INFO L225 Difference]: With dead ends: 252 [2018-01-21 10:22:17,899 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 10:22:17,903 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-21 10:22:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 10:22:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-21 10:22:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 10:22:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-01-21 10:22:17,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 25 [2018-01-21 10:22:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:22:17,943 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-01-21 10:22:17,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:22:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-01-21 10:22:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 10:22:17,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:22:17,945 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-21 10:22:17,946 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:22:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash 358615040, now seen corresponding path program 1 times [2018-01-21 10:22:17,946 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:22:17,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:17,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:22:17,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:17,948 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:22:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:22:17,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:22:18,045 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-21 10:22:18,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:22:18,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:22:18,046 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:22:18,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:22:18,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:22:18,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:22:18,048 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2018-01-21 10:22:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:22:18,104 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2018-01-21 10:22:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:22:18,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 10:22:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:22:18,107 INFO L225 Difference]: With dead ends: 240 [2018-01-21 10:22:18,107 INFO L226 Difference]: Without dead ends: 150 [2018-01-21 10:22:18,108 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-21 10:22:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-21 10:22:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-01-21 10:22:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-21 10:22:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2018-01-21 10:22:18,118 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 27 [2018-01-21 10:22:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:22:18,118 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2018-01-21 10:22:18,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:22:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2018-01-21 10:22:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:22:18,119 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:22:18,119 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-21 10:22:18,120 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:22:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1671536572, now seen corresponding path program 1 times [2018-01-21 10:22:18,120 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:22:18,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:18,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:22:18,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:18,121 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:22:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:22:18,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:22:18,176 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-21 10:22:18,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:22:18,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:22:18,177 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:22:18,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:22:18,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:22:18,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:22:18,178 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 3 states. [2018-01-21 10:22:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:22:18,215 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2018-01-21 10:22:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:22:18,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-21 10:22:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:22:18,217 INFO L225 Difference]: With dead ends: 151 [2018-01-21 10:22:18,217 INFO L226 Difference]: Without dead ends: 150 [2018-01-21 10:22:18,217 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-21 10:22:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-21 10:22:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-21 10:22:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-21 10:22:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2018-01-21 10:22:18,226 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 29 [2018-01-21 10:22:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:22:18,226 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2018-01-21 10:22:18,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:22:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2018-01-21 10:22:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 10:22:18,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:22:18,228 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-21 10:22:18,228 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:22:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1893588353, now seen corresponding path program 1 times [2018-01-21 10:22:18,228 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:22:18,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:18,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:22:18,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:18,229 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:22:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:22:18,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:22:18,297 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-21 10:22:18,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:22:18,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:22:18,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:22:18,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:22:18,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:22:18,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:22:18,299 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand 3 states. [2018-01-21 10:22:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:22:18,338 INFO L93 Difference]: Finished difference Result 306 states and 343 transitions. [2018-01-21 10:22:18,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:22:18,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-21 10:22:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:22:18,340 INFO L225 Difference]: With dead ends: 306 [2018-01-21 10:22:18,340 INFO L226 Difference]: Without dead ends: 164 [2018-01-21 10:22:18,341 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-21 10:22:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-21 10:22:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2018-01-21 10:22:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-21 10:22:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-01-21 10:22:18,354 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 44 [2018-01-21 10:22:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:22:18,354 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-01-21 10:22:18,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:22:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-01-21 10:22:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 10:22:18,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:22:18,356 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-21 10:22:18,356 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:22:18,357 INFO L82 PathProgramCache]: Analyzing trace with hash 178943670, now seen corresponding path program 1 times [2018-01-21 10:22:18,357 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:22:18,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:18,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:22:18,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:22:18,358 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:22:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:22:18,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:22:18,439 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-21 10:22:18,439 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:22:18,440 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:22:18,441 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-01-21 10:22:18,443 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-21 10:22:18,495 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:22:18,495 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:23:12,374 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 10:23:12,376 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-21 10:23:12,384 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 10:23:12,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:12,384 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-21 10:23:12,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:12,396 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:23:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:12,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:23:12,484 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-21 10:23:12,485 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:23:12,513 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-21 10:23:12,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:12,533 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-21 10:23:12,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:12,537 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:23:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:12,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:23:12,605 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-21 10:23:12,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:23:12,640 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-21 10:23:12,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:23:12,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 6 [2018-01-21 10:23:12,642 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:23:12,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:23:12,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:23:12,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:23:12,643 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 5 states. [2018-01-21 10:23:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:12,688 INFO L93 Difference]: Finished difference Result 324 states and 361 transitions. [2018-01-21 10:23:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:12,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-21 10:23:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:12,690 INFO L225 Difference]: With dead ends: 324 [2018-01-21 10:23:12,691 INFO L226 Difference]: Without dead ends: 178 [2018-01-21 10:23:12,692 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-21 10:23:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-21 10:23:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-01-21 10:23:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-21 10:23:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 184 transitions. [2018-01-21 10:23:12,706 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 184 transitions. Word has length 51 [2018-01-21 10:23:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:12,706 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 184 transitions. [2018-01-21 10:23:12,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:23:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 184 transitions. [2018-01-21 10:23:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-21 10:23:12,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:12,709 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-21 10:23:12,709 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:23:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 977028767, now seen corresponding path program 2 times [2018-01-21 10:23:12,709 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:12,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:12,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:12,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:12,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:12,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:12,799 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-21 10:23:12,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:12,800 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:23:12,800 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 10:23:12,800 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:23:12,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:12,801 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-21 10:23:12,809 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:23:12,809 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:23:12,844 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:23:12,871 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:23:12,873 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:23:12,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:23:12,890 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-21 10:23:12,891 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:23:12,918 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-21 10:23:12,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:12,957 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-21 10:23:12,963 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 10:23:12,963 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 10:23:13,014 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:23:13,183 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 10:23:13,201 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 10:23:13,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:23:13,213 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-21 10:23:13,214 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 10:23:13,251 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-21 10:23:13,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 10:23:13,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 6 [2018-01-21 10:23:13,253 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 10:23:13,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:23:13,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:23:13,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:23:13,254 INFO L87 Difference]: Start difference. First operand 168 states and 184 transitions. Second operand 6 states. [2018-01-21 10:23:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,338 INFO L93 Difference]: Finished difference Result 342 states and 379 transitions. [2018-01-21 10:23:13,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:23:13,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-21 10:23:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,339 INFO L225 Difference]: With dead ends: 342 [2018-01-21 10:23:13,339 INFO L226 Difference]: Without dead ends: 182 [2018-01-21 10:23:13,340 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 225 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:23:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-21 10:23:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-21 10:23:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-21 10:23:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 198 transitions. [2018-01-21 10:23:13,348 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 198 transitions. Word has length 58 [2018-01-21 10:23:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,348 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 198 transitions. [2018-01-21 10:23:13,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:23:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 198 transitions. [2018-01-21 10:23:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-21 10:23:13,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,350 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-21 10:23:13,350 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0EnsuresViolation]=== [2018-01-21 10:23:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 885354134, now seen corresponding path program 3 times [2018-01-21 10:23:13,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 10:23:13,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:23:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:23:13,472 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:23:13,492 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:23:13,506 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:23:13,530 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:23:13,530 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:23:13,530 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:23:13,530 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:23:13,530 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:23:13,530 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:23:13,531 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:23:13,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == freeDataErr0EnsuresViolation======== [2018-01-21 10:23:13,531 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:23:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-21 10:23:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:23:13,534 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,534 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-21 10:23:13,534 INFO L371 AbstractCegarLoop]: === Iteration 1 === [freeDataErr0EnsuresViolation]=== [2018-01-21 10:23:13,534 INFO L82 PathProgramCache]: Analyzing trace with hash 631302393, now seen corresponding path program 1 times [2018-01-21 10:23:13,534 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,536 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:13,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:13,547 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-21 10:23:13,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:13,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:23:13,548 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:13,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:23:13,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:23:13,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:23:13,549 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-21 10:23:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,556 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-21 10:23:13,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:23:13,556 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 10:23:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,558 INFO L225 Difference]: With dead ends: 251 [2018-01-21 10:23:13,558 INFO L226 Difference]: Without dead ends: 118 [2018-01-21 10:23:13,558 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-21 10:23:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-21 10:23:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-21 10:23:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-21 10:23:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-01-21 10:23:13,565 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 24 [2018-01-21 10:23:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,565 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-01-21 10:23:13,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:23:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-01-21 10:23:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-21 10:23:13,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,567 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-21 10:23:13,567 INFO L371 AbstractCegarLoop]: === Iteration 2 === [freeDataErr0EnsuresViolation]=== [2018-01-21 10:23:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash -60214454, now seen corresponding path program 1 times [2018-01-21 10:23:13,567 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:13,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:13,598 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-21 10:23:13,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:13,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:13,599 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:13,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:13,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:13,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:13,600 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 3 states. [2018-01-21 10:23:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,613 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2018-01-21 10:23:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:13,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-01-21 10:23:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,615 INFO L225 Difference]: With dead ends: 229 [2018-01-21 10:23:13,615 INFO L226 Difference]: Without dead ends: 119 [2018-01-21 10:23:13,616 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-21 10:23:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-21 10:23:13,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-21 10:23:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-21 10:23:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-21 10:23:13,622 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 54 [2018-01-21 10:23:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,622 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-21 10:23:13,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-21 10:23:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-21 10:23:13,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,624 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-21 10:23:13,624 INFO L371 AbstractCegarLoop]: === Iteration 3 === [freeDataErr0EnsuresViolation]=== [2018-01-21 10:23:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 152237805, now seen corresponding path program 1 times [2018-01-21 10:23:13,624 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,625 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:13,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:13,682 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-21 10:23:13,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:13,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:13,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:13,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:13,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:13,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:13,683 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 4 states. [2018-01-21 10:23:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,708 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-01-21 10:23:13,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:13,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-01-21 10:23:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,712 INFO L225 Difference]: With dead ends: 278 [2018-01-21 10:23:13,712 INFO L226 Difference]: Without dead ends: 167 [2018-01-21 10:23:13,713 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-21 10:23:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-21 10:23:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-01-21 10:23:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-21 10:23:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-01-21 10:23:13,722 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 56 [2018-01-21 10:23:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,723 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-01-21 10:23:13,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-01-21 10:23:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-21 10:23:13,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,725 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-21 10:23:13,725 INFO L371 AbstractCegarLoop]: === Iteration 4 === [freeDataErr0EnsuresViolation]=== [2018-01-21 10:23:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash -536266093, now seen corresponding path program 1 times [2018-01-21 10:23:13,725 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,726 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:13,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:13,766 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-21 10:23:13,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:13,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:13,767 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:13,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:13,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:13,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:13,768 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 3 states. [2018-01-21 10:23:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,780 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-01-21 10:23:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:13,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-21 10:23:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,782 INFO L225 Difference]: With dead ends: 190 [2018-01-21 10:23:13,783 INFO L226 Difference]: Without dead ends: 168 [2018-01-21 10:23:13,783 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-21 10:23:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-21 10:23:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-01-21 10:23:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-21 10:23:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2018-01-21 10:23:13,792 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 58 [2018-01-21 10:23:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,792 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2018-01-21 10:23:13,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2018-01-21 10:23:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-21 10:23:13,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,794 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-21 10:23:13,795 INFO L371 AbstractCegarLoop]: === Iteration 5 === [freeDataErr0EnsuresViolation]=== [2018-01-21 10:23:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2124613995, now seen corresponding path program 1 times [2018-01-21 10:23:13,795 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:13,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:13,877 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-21 10:23:13,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:13,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:13,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:13,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:13,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:13,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:13,879 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand 4 states. [2018-01-21 10:23:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,944 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2018-01-21 10:23:13,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:13,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-01-21 10:23:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,945 INFO L225 Difference]: With dead ends: 293 [2018-01-21 10:23:13,945 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:23:13,946 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-21 10:23:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:23:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:23:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:23:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:23:13,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-21 10:23:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,947 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:23:13,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:23:13,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:23:13,950 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:23:13,951 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:23:13,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:23:13,951 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:23:13,951 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:23:13,951 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:23:13,951 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:23:13,951 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:23:13,951 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:23:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-21 10:23:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:23:13,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,954 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:23:13,954 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:23:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash 242168, now seen corresponding path program 1 times [2018-01-21 10:23:13,954 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:23:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:23:13,960 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:23:13,961 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:23:13,963 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:23:13,963 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:23:13,963 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:23:13,963 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:23:13,963 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:23:13,963 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:23:13,963 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:23:13,963 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:23:13,963 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:23:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-21 10:23:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 10:23:13,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,965 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:23:13,965 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:23:13,966 INFO L82 PathProgramCache]: Analyzing trace with hash -920378739, now seen corresponding path program 1 times [2018-01-21 10:23:13,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:13,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:13,974 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-21 10:23:13,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:13,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:23:13,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:13,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:23:13,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:23:13,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:23:13,975 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-21 10:23:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:13,982 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-21 10:23:13,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:23:13,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 10:23:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:13,983 INFO L225 Difference]: With dead ends: 251 [2018-01-21 10:23:13,983 INFO L226 Difference]: Without dead ends: 124 [2018-01-21 10:23:13,984 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-21 10:23:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-21 10:23:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-21 10:23:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-21 10:23:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-21 10:23:13,989 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 16 [2018-01-21 10:23:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:13,990 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-21 10:23:13,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:23:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-21 10:23:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 10:23:13,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:13,991 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-21 10:23:13,991 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:23:13,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1643632883, now seen corresponding path program 1 times [2018-01-21 10:23:13,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:13,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:13,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:13,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,015 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-21 10:23:14,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:14,016 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:14,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:14,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:14,017 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 3 states. [2018-01-21 10:23:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,029 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-01-21 10:23:14,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:14,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-21 10:23:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,030 INFO L225 Difference]: With dead ends: 241 [2018-01-21 10:23:14,030 INFO L226 Difference]: Without dead ends: 125 [2018-01-21 10:23:14,031 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-21 10:23:14,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-21 10:23:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-21 10:23:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-21 10:23:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-21 10:23:14,036 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 48 [2018-01-21 10:23:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,036 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-21 10:23:14,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-21 10:23:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 10:23:14,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,038 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-21 10:23:14,038 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:23:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1336549616, now seen corresponding path program 1 times [2018-01-21 10:23:14,038 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,039 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,082 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-21 10:23:14,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:14,082 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:14,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:14,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:14,084 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 4 states. [2018-01-21 10:23:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,104 INFO L93 Difference]: Finished difference Result 290 states and 321 transitions. [2018-01-21 10:23:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:14,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-21 10:23:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,106 INFO L225 Difference]: With dead ends: 290 [2018-01-21 10:23:14,106 INFO L226 Difference]: Without dead ends: 173 [2018-01-21 10:23:14,107 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-21 10:23:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-21 10:23:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-01-21 10:23:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-01-21 10:23:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-01-21 10:23:14,116 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 50 [2018-01-21 10:23:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,116 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-01-21 10:23:14,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-01-21 10:23:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-21 10:23:14,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,118 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-21 10:23:14,118 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:23:14,118 INFO L82 PathProgramCache]: Analyzing trace with hash 518887702, now seen corresponding path program 1 times [2018-01-21 10:23:14,118 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,119 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,147 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-21 10:23:14,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:14,148 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:14,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:14,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:14,149 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 3 states. [2018-01-21 10:23:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,159 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-01-21 10:23:14,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:14,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-01-21 10:23:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,160 INFO L225 Difference]: With dead ends: 202 [2018-01-21 10:23:14,161 INFO L226 Difference]: Without dead ends: 174 [2018-01-21 10:23:14,161 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-21 10:23:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-21 10:23:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-01-21 10:23:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-21 10:23:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-01-21 10:23:14,169 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 52 [2018-01-21 10:23:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,169 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-01-21 10:23:14,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-01-21 10:23:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-21 10:23:14,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,171 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-21 10:23:14,171 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:23:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1219952280, now seen corresponding path program 1 times [2018-01-21 10:23:14,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,215 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-21 10:23:14,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:14,216 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:14,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:14,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:14,217 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 4 states. [2018-01-21 10:23:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,260 INFO L93 Difference]: Finished difference Result 299 states and 331 transitions. [2018-01-21 10:23:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:14,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-21 10:23:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,261 INFO L225 Difference]: With dead ends: 299 [2018-01-21 10:23:14,261 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:23:14,262 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-21 10:23:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:23:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:23:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:23:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:23:14,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-01-21 10:23:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,263 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:23:14,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:23:14,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:23:14,265 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:23:14,265 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:23:14,265 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:23:14,265 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:23:14,265 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:23:14,265 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:23:14,265 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:23:14,266 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:23:14,266 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:23:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-21 10:23:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 10:23:14,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,268 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:23:14,268 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:23:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -9896274, now seen corresponding path program 1 times [2018-01-21 10:23:14,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,276 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-21 10:23:14,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:23:14,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:23:14,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:23:14,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:23:14,277 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2018-01-21 10:23:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,283 INFO L93 Difference]: Finished difference Result 251 states and 288 transitions. [2018-01-21 10:23:14,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:23:14,284 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 10:23:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,284 INFO L225 Difference]: With dead ends: 251 [2018-01-21 10:23:14,285 INFO L226 Difference]: Without dead ends: 122 [2018-01-21 10:23:14,285 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-21 10:23:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-21 10:23:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-21 10:23:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-21 10:23:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-01-21 10:23:14,291 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 14 [2018-01-21 10:23:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,291 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-01-21 10:23:14,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:23:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-01-21 10:23:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 10:23:14,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,292 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-21 10:23:14,292 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:23:14,292 INFO L82 PathProgramCache]: Analyzing trace with hash 780411694, now seen corresponding path program 1 times [2018-01-21 10:23:14,292 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,294 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,315 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-21 10:23:14,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:14,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:14,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:14,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:14,316 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 3 states. [2018-01-21 10:23:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,329 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2018-01-21 10:23:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:14,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-01-21 10:23:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,331 INFO L225 Difference]: With dead ends: 237 [2018-01-21 10:23:14,331 INFO L226 Difference]: Without dead ends: 123 [2018-01-21 10:23:14,331 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-21 10:23:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-21 10:23:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-21 10:23:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-21 10:23:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-01-21 10:23:14,337 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 46 [2018-01-21 10:23:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,337 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-01-21 10:23:14,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-01-21 10:23:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 10:23:14,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,338 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-21 10:23:14,338 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:23:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash -820954671, now seen corresponding path program 1 times [2018-01-21 10:23:14,339 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,383 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-21 10:23:14,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:14,384 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:14,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:14,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:14,385 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 4 states. [2018-01-21 10:23:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,405 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-01-21 10:23:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:14,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-21 10:23:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,407 INFO L225 Difference]: With dead ends: 286 [2018-01-21 10:23:14,407 INFO L226 Difference]: Without dead ends: 171 [2018-01-21 10:23:14,408 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-21 10:23:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-21 10:23:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-01-21 10:23:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-21 10:23:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-01-21 10:23:14,415 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 48 [2018-01-21 10:23:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,415 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-01-21 10:23:14,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-01-21 10:23:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 10:23:14,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,417 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-21 10:23:14,417 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:23:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1560314743, now seen corresponding path program 1 times [2018-01-21 10:23:14,418 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,419 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,450 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-21 10:23:14,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:14,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:14,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:14,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:14,452 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 3 states. [2018-01-21 10:23:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,464 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2018-01-21 10:23:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:14,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-01-21 10:23:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,466 INFO L225 Difference]: With dead ends: 198 [2018-01-21 10:23:14,466 INFO L226 Difference]: Without dead ends: 172 [2018-01-21 10:23:14,466 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-21 10:23:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-21 10:23:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-01-21 10:23:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-21 10:23:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-01-21 10:23:14,474 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 50 [2018-01-21 10:23:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,474 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-01-21 10:23:14,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-01-21 10:23:14,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 10:23:14,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,476 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-21 10:23:14,476 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 10:23:14,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594183, now seen corresponding path program 1 times [2018-01-21 10:23:14,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,477 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,521 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-21 10:23:14,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:14,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:14,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:14,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:14,522 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 4 states. [2018-01-21 10:23:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,569 INFO L93 Difference]: Finished difference Result 297 states and 329 transitions. [2018-01-21 10:23:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:14,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-01-21 10:23:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,570 INFO L225 Difference]: With dead ends: 297 [2018-01-21 10:23:14,570 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:23:14,571 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-21 10:23:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:23:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:23:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:23:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:23:14,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-01-21 10:23:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,573 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:23:14,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:23:14,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:23:14,574 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:23:14,574 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:23:14,575 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:23:14,575 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:23:14,575 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:23:14,575 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:23:14,575 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:23:14,575 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 10:23:14,575 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:23:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2018-01-21 10:23:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:23:14,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,577 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] [2018-01-21 10:23:14,578 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 10:23:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash 986487837, now seen corresponding path program 1 times [2018-01-21 10:23:14,578 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,612 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-21 10:23:14,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:14,613 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:14,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:14,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:14,614 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2018-01-21 10:23:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,628 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2018-01-21 10:23:14,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:14,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-21 10:23:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,629 INFO L225 Difference]: With dead ends: 252 [2018-01-21 10:23:14,629 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 10:23:14,630 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-21 10:23:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 10:23:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-21 10:23:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 10:23:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-01-21 10:23:14,635 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 30 [2018-01-21 10:23:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,635 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-01-21 10:23:14,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-01-21 10:23:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:23:14,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,636 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] [2018-01-21 10:23:14,636 INFO L371 AbstractCegarLoop]: === Iteration 2 === [appendErr0EnsuresViolation]=== [2018-01-21 10:23:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash -131508032, now seen corresponding path program 1 times [2018-01-21 10:23:14,636 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,638 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,692 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-21 10:23:14,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:23:14,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:23:14,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:23:14,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:23:14,693 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 4 states. [2018-01-21 10:23:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:14,712 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-01-21 10:23:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:23:14,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-21 10:23:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:14,714 INFO L225 Difference]: With dead ends: 236 [2018-01-21 10:23:14,714 INFO L226 Difference]: Without dead ends: 146 [2018-01-21 10:23:14,714 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-21 10:23:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-21 10:23:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-21 10:23:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-21 10:23:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2018-01-21 10:23:14,721 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 32 [2018-01-21 10:23:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:14,721 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2018-01-21 10:23:14,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:23:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2018-01-21 10:23:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 10:23:14,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:14,722 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] [2018-01-21 10:23:14,722 INFO L371 AbstractCegarLoop]: === Iteration 3 === [appendErr0EnsuresViolation]=== [2018-01-21 10:23:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1463594598, now seen corresponding path program 1 times [2018-01-21 10:23:14,722 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:14,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:14,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:14,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:14,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:14,927 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-21 10:23:14,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:14,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-21 10:23:14,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:14,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 10:23:14,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 10:23:14,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-21 10:23:14,928 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand 10 states. [2018-01-21 10:23:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:15,354 INFO L93 Difference]: Finished difference Result 297 states and 333 transitions. [2018-01-21 10:23:15,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 10:23:15,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-21 10:23:15,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:15,356 INFO L225 Difference]: With dead ends: 297 [2018-01-21 10:23:15,356 INFO L226 Difference]: Without dead ends: 159 [2018-01-21 10:23:15,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-01-21 10:23:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-21 10:23:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-01-21 10:23:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-21 10:23:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 173 transitions. [2018-01-21 10:23:15,364 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 173 transitions. Word has length 34 [2018-01-21 10:23:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:15,365 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 173 transitions. [2018-01-21 10:23:15,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 10:23:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2018-01-21 10:23:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 10:23:15,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:15,366 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] [2018-01-21 10:23:15,366 INFO L371 AbstractCegarLoop]: === Iteration 4 === [appendErr0EnsuresViolation]=== [2018-01-21 10:23:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2120152481, now seen corresponding path program 1 times [2018-01-21 10:23:15,366 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:15,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:15,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:15,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:15,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:15,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:15,399 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-21 10:23:15,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:23:15,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:23:15,400 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:23:15,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:23:15,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:23:15,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:23:15,401 INFO L87 Difference]: Start difference. First operand 156 states and 173 transitions. Second operand 3 states. [2018-01-21 10:23:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:23:15,417 INFO L93 Difference]: Finished difference Result 308 states and 348 transitions. [2018-01-21 10:23:15,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:23:15,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-01-21 10:23:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:23:15,418 INFO L225 Difference]: With dead ends: 308 [2018-01-21 10:23:15,419 INFO L226 Difference]: Without dead ends: 170 [2018-01-21 10:23:15,420 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-21 10:23:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-21 10:23:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 160. [2018-01-21 10:23:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-21 10:23:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2018-01-21 10:23:15,429 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 177 transitions. Word has length 49 [2018-01-21 10:23:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:23:15,429 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 177 transitions. [2018-01-21 10:23:15,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:23:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2018-01-21 10:23:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-21 10:23:15,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:23:15,430 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, 1, 1, 1, 1, 1] [2018-01-21 10:23:15,430 INFO L371 AbstractCegarLoop]: === Iteration 5 === [appendErr0EnsuresViolation]=== [2018-01-21 10:23:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1396331574, now seen corresponding path program 1 times [2018-01-21 10:23:15,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:23:15,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:15,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:15,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:23:15,432 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:23:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:15,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:23:15,498 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-21 10:23:15,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:15,499 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:23:15,499 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-21 10:23:15,499 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], [104], [106], [107], [108], [112], [180], [181], [187], [188], [189], [190], [191], [192], [193], [196], [198], [199], [208], [210], [211], [215], [216], [217], [219], [220] [2018-01-21 10:23:15,501 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:23:15,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 10:23:15,513 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 10:23:15,513 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 10:23:15,514 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:23:15,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:23:15,514 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:23:15,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:23:15,554 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:23:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:23:15,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:23:15,605 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 10:23:15,605 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:23:15,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:23:15 BoogieIcfgContainer [2018-01-21 10:23:15,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:23:15,608 INFO L168 Benchmark]: Toolchain (without parser) took 59119.13 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 260.8 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 144.2 MB. Max. memory is 5.3 GB. [2018-01-21 10:23:15,609 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:23:15,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.26 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 248.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:23:15,610 INFO L168 Benchmark]: Boogie Preprocessor took 38.78 ms. Allocated memory is still 302.5 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:23:15,610 INFO L168 Benchmark]: RCFGBuilder took 595.98 ms. Allocated memory is still 302.5 MB. Free memory was 246.7 MB in the beginning and 211.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:23:15,610 INFO L168 Benchmark]: TraceAbstraction took 58244.80 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 210.8 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 94.3 MB. Max. memory is 5.3 GB. [2018-01-21 10:23:15,612 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.26 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 248.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.78 ms. Allocated memory is still 302.5 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 595.98 ms. Allocated memory is still 302.5 MB. Free memory was 246.7 MB in the beginning and 211.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58244.80 ms. Allocated memory was 302.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 210.8 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 94.3 MB. 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) : 1427.427738 RENAME_VARIABLES(MILLISECONDS) : 202.119458 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1427.361274 PROJECTAWAY(MILLISECONDS) : 0.191047 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034796 DISJOIN(MILLISECONDS) : 33.660027 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 202.191806 ADD_EQUALITY(MILLISECONDS) : 0.014025 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012118 #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, 56.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.1s 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, 53.9s 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.5s SatisfiabilityAnalysisTime, 0.5s 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.4s 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.0s 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 - PositiveResult [Line: 585]: 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: mainErr0EnsuresViolation 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: 673 SDtfs, 121 SDslu, 501 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=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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s 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 BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 4 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 6 procedures, 130 locations, 6 error locations. TIMEOUT Result, 1.0s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 146 SDslu, 754 SDs, 0 SdLazy, 253 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred 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, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 16537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-23-15-623.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-23-15-623.csv Completed graceful shutdown