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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:35:51,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:35:51,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:35:51,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:35:51,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:35:51,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:35:51,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:35:51,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:35:51,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:35:51,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:35:51,060 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:35:51,060 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:35:51,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:35:51,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:35:51,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:35:51,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:35:51,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:35:51,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:35:51,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:35:51,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:35:51,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:35:51,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:35:51,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:35:51,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:35:51,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:35:51,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:35:51,080 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:35:51,081 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:35:51,081 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:35:51,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:35:51,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:35:51,082 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:35:51,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:35:51,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:35:51,094 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:35:51,094 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:35:51,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:35:51,095 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:35:51,095 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:35:51,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:35:51,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:35:51,096 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:35:51,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:35:51,096 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:35:51,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:35:51,097 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:35:51,097 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:35:51,097 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:35:51,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:35:51,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:35:51,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:35:51,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:35:51,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:35:51,098 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:35:51,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:35:51,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:35:51,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:35:51,099 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:35:51,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:35:51,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:35:51,100 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:35:51,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:35:51,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:35:51,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:35:51,101 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:35:51,101 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:35:51,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:35:51,149 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:35:51,153 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:35:51,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:35:51,155 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:35:51,156 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-24 13:35:51,337 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:35:51,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:35:51,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:35:51,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:35:51,350 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:35:51,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732f9a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51, skipping insertion in model container [2018-01-24 13:35:51,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,366 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:35:51,404 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:35:51,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:35:51,544 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:35:51,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51 WrapperNode [2018-01-24 13:35:51,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:35:51,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:35:51,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:35:51,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:35:51,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:35:51,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:35:51,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:35:51,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:35:51,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:35:51,639 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:35:51,640 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:35:51,640 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-24 13:35:51,640 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-24 13:35:51,640 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-24 13:35:51,640 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-24 13:35:51,640 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:35:51,640 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:35:51,640 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:35:51,640 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:35:51,640 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:35:51,641 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:35:51,642 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:35:52,067 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:35:52,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:35:52 BoogieIcfgContainer [2018-01-24 13:35:52,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:35:52,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:35:52,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:35:52,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:35:52,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:35:51" (1/3) ... [2018-01-24 13:35:52,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e120f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:35:52, skipping insertion in model container [2018-01-24 13:35:52,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (2/3) ... [2018-01-24 13:35:52,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e120f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:35:52, skipping insertion in model container [2018-01-24 13:35:52,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:35:52" (3/3) ... [2018-01-24 13:35:52,076 INFO L105 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-24 13:35:52,082 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:35:52,090 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 13:35:52,139 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:35:52,139 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:35:52,139 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:35:52,139 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:35:52,139 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:35:52,139 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:35:52,139 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:35:52,139 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:35:52,140 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:35:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-24 13:35:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:35:52,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:52,164 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:52,164 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-24 13:35:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-01-24 13:35:52,171 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:52,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:52,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:52,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:52,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:52,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:35:52,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:52,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:35:52,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:35:52,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:35:52,342 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-01-24 13:35:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:52,598 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2018-01-24 13:35:52,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:35:52,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:35:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:52,612 INFO L225 Difference]: With dead ends: 216 [2018-01-24 13:35:52,612 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 13:35:52,617 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:35:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 13:35:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-24 13:35:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 13:35:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-24 13:35:52,669 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-01-24 13:35:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:52,669 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-24 13:35:52,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:35:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-24 13:35:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 13:35:52,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:52,670 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:52,670 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-24 13:35:52,671 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-01-24 13:35:52,671 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:52,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:52,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,673 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:52,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:52,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:52,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:35:52,746 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:52,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:35:52,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:35:52,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:35:52,748 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-01-24 13:35:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:52,893 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-24 13:35:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:35:52,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 13:35:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:52,895 INFO L225 Difference]: With dead ends: 116 [2018-01-24 13:35:52,895 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 13:35:52,896 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:35:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 13:35:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 13:35:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 13:35:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-01-24 13:35:52,909 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-01-24 13:35:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:52,909 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-01-24 13:35:52,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:35:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-01-24 13:35:52,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:35:52,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:52,911 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:52,911 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-24 13:35:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-01-24 13:35:52,911 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:52,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:52,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:52,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:52,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:52,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:35:52,988 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:52,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:35:52,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:35:52,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:35:52,989 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-01-24 13:35:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,144 INFO L93 Difference]: Finished difference Result 239 states and 278 transitions. [2018-01-24 13:35:53,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:35:53,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 13:35:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,149 INFO L225 Difference]: With dead ends: 239 [2018-01-24 13:35:53,149 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 13:35:53,150 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-24 13:35:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 13:35:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-01-24 13:35:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 13:35:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-01-24 13:35:53,172 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-01-24 13:35:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,172 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-01-24 13:35:53,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:35:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-01-24 13:35:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:35:53,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,173 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-24 13:35:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-01-24 13:35:53,174 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,179 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:53,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:53,241 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:53,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:53,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:53,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:53,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:53,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:53,243 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-01-24 13:35:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,491 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2018-01-24 13:35:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:35:53,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 13:35:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,494 INFO L225 Difference]: With dead ends: 156 [2018-01-24 13:35:53,494 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 13:35:53,494 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-24 13:35:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 13:35:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-01-24 13:35:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 13:35:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-01-24 13:35:53,512 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-01-24 13:35:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,512 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-01-24 13:35:53,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-01-24 13:35:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:35:53,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,513 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,513 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-24 13:35:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-01-24 13:35:53,513 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:53,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:53,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:53,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:53,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:53,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:53,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:53,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:53,608 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-01-24 13:35:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,732 INFO L93 Difference]: Finished difference Result 157 states and 191 transitions. [2018-01-24 13:35:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:35:53,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 13:35:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,734 INFO L225 Difference]: With dead ends: 157 [2018-01-24 13:35:53,734 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 13:35:53,734 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-24 13:35:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 13:35:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-01-24 13:35:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 13:35:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-01-24 13:35:53,750 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-01-24 13:35:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,750 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-01-24 13:35:53,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-01-24 13:35:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:35:53,752 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,752 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,752 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-24 13:35:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-01-24 13:35:53,753 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,754 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:53,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:53,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:53,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:35:53,865 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:53,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:35:53,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:35:53,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:35:53,866 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 6 states. [2018-01-24 13:35:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:54,094 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-01-24 13:35:54,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:35:54,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 13:35:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:54,095 INFO L225 Difference]: With dead ends: 134 [2018-01-24 13:35:54,096 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 13:35:54,096 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-24 13:35:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 13:35:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-24 13:35:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 13:35:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-01-24 13:35:54,109 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-01-24 13:35:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:54,110 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-01-24 13:35:54,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:35:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-01-24 13:35:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:35:54,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:54,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:54,111 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-24 13:35:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-01-24 13:35:54,111 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:54,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:54,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:54,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:54,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:54,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:54,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:54,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:54,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:54,189 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-01-24 13:35:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:54,276 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2018-01-24 13:35:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:35:54,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 13:35:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:54,278 INFO L225 Difference]: With dead ends: 133 [2018-01-24 13:35:54,278 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 13:35:54,278 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-24 13:35:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 13:35:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 13:35:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 13:35:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-01-24 13:35:54,289 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-01-24 13:35:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:54,289 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-01-24 13:35:54,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-01-24 13:35:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:35:54,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:54,290 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-24 13:35:54,290 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-24 13:35:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-01-24 13:35:54,290 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:54,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:54,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:54,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:54,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:35:54,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:54,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:35:54,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:35:54,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:35:54,348 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-01-24 13:35:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:54,581 INFO L93 Difference]: Finished difference Result 161 states and 190 transitions. [2018-01-24 13:35:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:35:54,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 13:35:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:54,582 INFO L225 Difference]: With dead ends: 161 [2018-01-24 13:35:54,583 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 13:35:54,583 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-24 13:35:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 13:35:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-01-24 13:35:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 13:35:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-01-24 13:35:54,594 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-01-24 13:35:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:54,594 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-01-24 13:35:54,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:35:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-01-24 13:35:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:35:54,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:54,595 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-24 13:35:54,595 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-24 13:35:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-01-24 13:35:54,595 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:54,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:54,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,597 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:54,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:54,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:35:54,663 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:54,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:35:54,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:35:54,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:35:54,664 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-01-24 13:35:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:54,938 INFO L93 Difference]: Finished difference Result 158 states and 181 transitions. [2018-01-24 13:35:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:35:54,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 13:35:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:54,940 INFO L225 Difference]: With dead ends: 158 [2018-01-24 13:35:54,940 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 13:35:54,941 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-24 13:35:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 13:35:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-01-24 13:35:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 13:35:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-01-24 13:35:54,955 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-01-24 13:35:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:54,955 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-01-24 13:35:54,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:35:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-01-24 13:35:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:35:54,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:54,957 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-24 13:35:54,957 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-24 13:35:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-01-24 13:35:54,957 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:54,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:54,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:55,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:55,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:35:55,123 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:55,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:35:55,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:35:55,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:35:55,124 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-01-24 13:35:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:55,409 INFO L93 Difference]: Finished difference Result 233 states and 275 transitions. [2018-01-24 13:35:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:35:55,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 13:35:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:55,412 INFO L225 Difference]: With dead ends: 233 [2018-01-24 13:35:55,412 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 13:35:55,413 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-24 13:35:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 13:35:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-01-24 13:35:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 13:35:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-01-24 13:35:55,429 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-01-24 13:35:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:55,430 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-01-24 13:35:55,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:35:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-01-24 13:35:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:35:55,431 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:55,432 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-24 13:35:55,432 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-24 13:35:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-01-24 13:35:55,432 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:55,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:55,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:55,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:55,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:55,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:55,483 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-24 13:35:55,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:35:55,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:35:55,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:55,494 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:35:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:55,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:35:55,622 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-24 13:35:55,622 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:35:55,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:35:55,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:55,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:55,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 13:35:55,684 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-24 13:35:55,720 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:35:55,720 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:35:55,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:55,731 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:35:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:55,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:35:55,826 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-24 13:35:55,826 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:35:55,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-24 13:35:55,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:55,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:55,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 13:35:55,854 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-24 13:35:55,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:35:55,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 5 [2018-01-24 13:35:55,859 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:35:55,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:35:55,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:35:55,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:35:55,860 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 6 states. [2018-01-24 13:35:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:56,190 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2018-01-24 13:35:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:35:56,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 13:35:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:56,192 INFO L225 Difference]: With dead ends: 171 [2018-01-24 13:35:56,193 INFO L226 Difference]: Without dead ends: 169 [2018-01-24 13:35:56,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:35:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-24 13:35:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-01-24 13:35:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-24 13:35:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-01-24 13:35:56,210 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 24 [2018-01-24 13:35:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:56,211 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-01-24 13:35:56,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:35:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-01-24 13:35:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:35:56,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:56,212 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-24 13:35:56,212 INFO L371 AbstractCegarLoop]: === Iteration 12 === [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-24 13:35:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash 560220084, now seen corresponding path program 1 times [2018-01-24 13:35:56,213 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:56,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:56,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:56,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:56,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:56,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:56,266 ERROR L119 erpolLogProxyWrapper]: Interpolant 16 not inductive: (Check returned sat) [2018-01-24 13:35:56,279 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 13:35:56,283 INFO L168 Benchmark]: Toolchain (without parser) took 4945.42 ms. Allocated memory was 308.8 MB in the beginning and 521.7 MB in the end (delta: 212.9 MB). Free memory was 267.8 MB in the beginning and 468.9 MB in the end (delta: -201.1 MB). Peak memory consumption was 11.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:56,284 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:35:56,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.04 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 255.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:56,285 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 308.8 MB. Free memory was 255.9 MB in the beginning and 253.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:56,285 INFO L168 Benchmark]: RCFGBuilder took 476.71 ms. Allocated memory is still 308.8 MB. Free memory was 253.9 MB in the beginning and 223.4 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-01-24 13:35:56,286 INFO L168 Benchmark]: TraceAbstraction took 4212.93 ms. Allocated memory was 308.8 MB in the beginning and 521.7 MB in the end (delta: 212.9 MB). Free memory was 223.4 MB in the beginning and 468.9 MB in the end (delta: -245.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:35:56,288 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.18 ms. Allocated memory is still 308.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.04 ms. Allocated memory is still 308.8 MB. Free memory was 267.8 MB in the beginning and 255.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 308.8 MB. Free memory was 255.9 MB in the beginning and 253.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 476.71 ms. Allocated memory is still 308.8 MB. Free memory was 253.9 MB in the beginning and 223.4 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4212.93 ms. Allocated memory was 308.8 MB in the beginning and 521.7 MB in the end (delta: 212.9 MB). Free memory was 223.4 MB in the beginning and 468.9 MB in the end (delta: -245.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-35-56-297.csv Received shutdown request...