java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:40:17,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:40:17,166 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:40:17,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:40:17,193 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:40:17,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:40:17,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:40:17,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:40:17,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:40:17,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:40:17,224 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:40:17,224 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:40:17,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:40:17,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:40:17,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:40:17,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:40:17,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:40:17,252 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:40:17,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:40:17,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:40:17,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:40:17,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:40:17,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:40:17,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:40:17,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:40:17,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:40:17,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:40:17,267 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:40:17,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:40:17,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:40:17,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:40:17,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:40:17,280 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:40:17,280 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:40:17,281 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:40:17,282 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:40:17,282 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:40:17,282 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:40:17,282 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:40:17,282 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:40:17,283 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:40:17,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:40:17,284 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:40:17,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:40:17,284 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:40:17,284 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:40:17,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:40:17,285 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:40:17,285 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:40:17,285 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:40:17,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:40:17,285 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:40:17,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:40:17,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:40:17,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:40:17,294 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:40:17,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:40:17,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:40:17,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:40:17,295 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:40:17,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:40:17,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:40:17,296 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:40:17,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:40:17,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:40:17,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:40:17,297 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:40:17,297 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:40:17,298 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:40:17,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:40:17,415 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:40:17,430 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:40:17,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:40:17,439 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:40:17,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-01-25 03:40:17,804 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:40:17,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:40:17,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:40:17,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:40:17,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:40:17,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:40:17" (1/1) ... [2018-01-25 03:40:17,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f62163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:17, skipping insertion in model container [2018-01-25 03:40:17,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:40:17" (1/1) ... [2018-01-25 03:40:17,857 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:40:17,988 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:40:18,184 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:40:18,208 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:40:18,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18 WrapperNode [2018-01-25 03:40:18,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:40:18,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:40:18,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:40:18,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:40:18,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... [2018-01-25 03:40:18,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:40:18,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:40:18,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:40:18,281 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:40:18,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:40:18,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:40:18,344 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:40:18,344 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-25 03:40:18,344 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-25 03:40:18,344 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-25 03:40:18,344 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-25 03:40:18,344 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:40:18,344 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:40:18,344 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 03:40:18,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-25 03:40:18,346 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-25 03:40:18,346 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-25 03:40:18,346 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-25 03:40:18,346 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:40:18,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:40:18,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:40:18,904 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:40:18,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:40:18 BoogieIcfgContainer [2018-01-25 03:40:18,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:40:18,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:40:18,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:40:18,908 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:40:18,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:40:17" (1/3) ... [2018-01-25 03:40:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8a031f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:40:18, skipping insertion in model container [2018-01-25 03:40:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:40:18" (2/3) ... [2018-01-25 03:40:18,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8a031f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:40:18, skipping insertion in model container [2018-01-25 03:40:18,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:40:18" (3/3) ... [2018-01-25 03:40:18,912 INFO L105 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-25 03:40:18,920 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:40:18,947 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-25 03:40:19,026 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:40:19,027 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:40:19,027 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:40:19,027 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:40:19,027 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:40:19,027 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:40:19,027 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:40:19,028 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:40:19,029 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:40:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-25 03:40:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:40:19,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:19,078 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:19,078 INFO L371 AbstractCegarLoop]: === Iteration 1 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-01-25 03:40:19,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:19,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:19,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:19,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:19,152 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:19,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:19,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:19,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:40:19,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:19,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:40:19,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:40:19,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:40:19,322 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-01-25 03:40:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:19,587 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2018-01-25 03:40:19,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:40:19,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:40:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:19,599 INFO L225 Difference]: With dead ends: 216 [2018-01-25 03:40:19,599 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 03:40:19,605 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-25 03:40:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 03:40:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-25 03:40:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 03:40:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-25 03:40:19,654 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-01-25 03:40:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:19,655 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-25 03:40:19,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:40:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-25 03:40:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:40:19,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:19,657 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:19,658 INFO L371 AbstractCegarLoop]: === Iteration 2 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-01-25 03:40:19,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:19,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:19,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:19,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:19,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:19,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:19,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:19,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:40:19,731 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:19,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:40:19,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:40:19,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:40:19,734 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-01-25 03:40:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:19,992 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-25 03:40:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:40:19,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:40:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:19,994 INFO L225 Difference]: With dead ends: 116 [2018-01-25 03:40:19,994 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 03:40:19,996 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-25 03:40:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 03:40:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 03:40:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 03:40:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-01-25 03:40:20,010 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-01-25 03:40:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:20,010 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-01-25 03:40:20,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:40:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-01-25 03:40:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:40:20,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:20,012 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:20,012 INFO L371 AbstractCegarLoop]: === Iteration 3 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-01-25 03:40:20,012 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:20,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:20,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:20,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:20,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:20,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:40:20,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:20,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:40:20,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:40:20,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:40:20,134 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-01-25 03:40:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:20,362 INFO L93 Difference]: Finished difference Result 239 states and 278 transitions. [2018-01-25 03:40:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:40:20,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:40:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:20,366 INFO L225 Difference]: With dead ends: 239 [2018-01-25 03:40:20,366 INFO L226 Difference]: Without dead ends: 150 [2018-01-25 03:40:20,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:40:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-25 03:40:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-01-25 03:40:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 03:40:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-01-25 03:40:20,388 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-01-25 03:40:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:20,389 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-01-25 03:40:20,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:40:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-01-25 03:40:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:40:20,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:20,390 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:20,390 INFO L371 AbstractCegarLoop]: === Iteration 4 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-01-25 03:40:20,390 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:20,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:20,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:20,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:20,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:20,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:40:20,476 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:20,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:40:20,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:40:20,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:40:20,477 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-01-25 03:40:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:20,629 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2018-01-25 03:40:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:40:20,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:40:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:20,631 INFO L225 Difference]: With dead ends: 156 [2018-01-25 03:40:20,631 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 03:40:20,632 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-25 03:40:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 03:40:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-01-25 03:40:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-25 03:40:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-01-25 03:40:20,652 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-01-25 03:40:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:20,652 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-01-25 03:40:20,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:40:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-01-25 03:40:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:40:20,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:20,653 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:20,654 INFO L371 AbstractCegarLoop]: === Iteration 5 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-01-25 03:40:20,654 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:20,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:20,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:20,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:20,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:20,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:40:20,763 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:20,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:40:20,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:40:20,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:40:20,764 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-01-25 03:40:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:20,911 INFO L93 Difference]: Finished difference Result 157 states and 191 transitions. [2018-01-25 03:40:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:40:20,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:40:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:20,914 INFO L225 Difference]: With dead ends: 157 [2018-01-25 03:40:20,914 INFO L226 Difference]: Without dead ends: 155 [2018-01-25 03:40:20,915 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:40:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-25 03:40:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-01-25 03:40:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-25 03:40:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-01-25 03:40:20,935 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-01-25 03:40:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:20,936 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-01-25 03:40:20,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:40:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-01-25 03:40:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:40:20,937 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:20,937 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:20,937 INFO L371 AbstractCegarLoop]: === Iteration 6 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-01-25 03:40:20,938 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:20,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:20,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:20,940 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:20,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:21,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:21,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:40:21,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:21,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:40:21,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:40:21,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:40:21,045 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 6 states. [2018-01-25 03:40:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:21,629 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-01-25 03:40:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:40:21,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-25 03:40:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:21,639 INFO L225 Difference]: With dead ends: 134 [2018-01-25 03:40:21,639 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 03:40:21,639 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:40:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 03:40:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-25 03:40:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 03:40:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-01-25 03:40:21,657 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-01-25 03:40:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:21,657 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-01-25 03:40:21,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:40:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-01-25 03:40:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:40:21,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:21,658 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:21,659 INFO L371 AbstractCegarLoop]: === Iteration 7 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-01-25 03:40:21,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:21,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:21,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:21,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:21,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:21,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:21,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:21,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:40:21,875 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:21,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:40:21,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:40:21,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:40:21,877 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-01-25 03:40:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:22,137 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2018-01-25 03:40:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:40:22,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-25 03:40:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:22,139 INFO L225 Difference]: With dead ends: 133 [2018-01-25 03:40:22,139 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 03:40:22,140 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:40:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 03:40:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-25 03:40:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 03:40:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-01-25 03:40:22,155 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-01-25 03:40:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:22,162 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-01-25 03:40:22,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:40:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-01-25 03:40:22,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:40:22,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:22,164 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:22,164 INFO L371 AbstractCegarLoop]: === Iteration 8 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:22,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-01-25 03:40:22,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:22,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:22,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:22,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:22,166 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:22,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:22,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:22,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:40:22,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:22,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:40:22,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:40:22,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:40:22,229 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-01-25 03:40:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:22,505 INFO L93 Difference]: Finished difference Result 161 states and 190 transitions. [2018-01-25 03:40:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:40:22,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 03:40:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:22,506 INFO L225 Difference]: With dead ends: 161 [2018-01-25 03:40:22,507 INFO L226 Difference]: Without dead ends: 155 [2018-01-25 03:40:22,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:40:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-25 03:40:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-01-25 03:40:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 03:40:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-01-25 03:40:22,520 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-01-25 03:40:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:22,521 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-01-25 03:40:22,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:40:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-01-25 03:40:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:40:22,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:22,522 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:40:22,522 INFO L371 AbstractCegarLoop]: === Iteration 9 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-01-25 03:40:22,522 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:22,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:22,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:22,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:22,523 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:22,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:22,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:22,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:40:22,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:22,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:40:22,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:40:22,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:40:22,790 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-01-25 03:40:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:23,183 INFO L93 Difference]: Finished difference Result 158 states and 181 transitions. [2018-01-25 03:40:23,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:40:23,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 03:40:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:23,184 INFO L225 Difference]: With dead ends: 158 [2018-01-25 03:40:23,185 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 03:40:23,185 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:40:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 03:40:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-01-25 03:40:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-25 03:40:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-01-25 03:40:23,202 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-01-25 03:40:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:23,203 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-01-25 03:40:23,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:40:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-01-25 03:40:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:40:23,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:23,204 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-25 03:40:23,204 INFO L371 AbstractCegarLoop]: === Iteration 10 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:23,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-01-25 03:40:23,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:23,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:23,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:23,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:23,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:23,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:40:23,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:40:23,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:40:23,404 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:40:23,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:40:23,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:40:23,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:40:23,406 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-01-25 03:40:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:40:23,928 INFO L93 Difference]: Finished difference Result 233 states and 275 transitions. [2018-01-25 03:40:23,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:40:23,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-25 03:40:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:40:23,930 INFO L225 Difference]: With dead ends: 233 [2018-01-25 03:40:23,930 INFO L226 Difference]: Without dead ends: 170 [2018-01-25 03:40:23,931 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:40:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-25 03:40:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-01-25 03:40:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-25 03:40:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-01-25 03:40:23,951 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-01-25 03:40:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:40:23,951 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-01-25 03:40:23,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:40:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-01-25 03:40:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:40:23,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:40:23,952 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] [2018-01-25 03:40:23,952 INFO L371 AbstractCegarLoop]: === Iteration 11 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-25 03:40:23,952 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-01-25 03:40:23,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:40:23,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:23,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:40:23,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:40:23,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:40:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:40:23,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:40:24,037 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-25 03:40:24,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:40:24,037 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:40:24,038 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 03:40:24,041 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [11], [15], [17], [18], [19], [24], [25], [28], [31], [36], [65], [69], [71], [123], [124], [172], [188], [189], [190] [2018-01-25 03:40:24,108 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:40:24,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown