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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 19:31:43,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 19:31:43,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 19:31:43,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 19:31:43,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 19:31:43,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 19:31:43,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 19:31:43,101 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 19:31:43,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 19:31:43,103 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 19:31:43,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 19:31:43,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 19:31:43,105 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 19:31:43,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 19:31:43,107 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 19:31:43,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 19:31:43,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 19:31:43,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 19:31:43,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 19:31:43,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 19:31:43,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 19:31:43,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 19:31:43,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 19:31:43,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 19:31:43,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 19:31:43,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 19:31:43,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 19:31:43,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 19:31:43,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 19:31:43,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 19:31:43,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 19:31:43,120 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 19:31:43,128 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 19:31:43,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 19:31:43,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 19:31:43,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 19:31:43,130 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 19:31:43,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 19:31:43,130 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 19:31:43,130 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 19:31:43,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 19:31:43,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 19:31:43,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 19:31:43,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 19:31:43,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 19:31:43,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 19:31:43,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 19:31:43,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 19:31:43,133 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 19:31:43,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 19:31:43,133 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 19:31:43,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 19:31:43,168 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 19:31:43,171 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 19:31:43,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 19:31:43,172 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 19:31:43,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-02-02 19:31:43,291 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 19:31:43,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 19:31:43,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 19:31:43,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 19:31:43,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 19:31:43,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1892f711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43, skipping insertion in model container [2018-02-02 19:31:43,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,318 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:31:43,350 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 19:31:43,446 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:31:43,463 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 19:31:43,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43 WrapperNode [2018-02-02 19:31:43,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 19:31:43,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 19:31:43,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 19:31:43,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 19:31:43,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... [2018-02-02 19:31:43,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 19:31:43,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 19:31:43,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 19:31:43,502 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 19:31:43,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 19:31:43,544 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 19:31:43,544 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 19:31:43,544 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 19:31:43,544 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-02-02 19:31:43,544 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-02-02 19:31:43,544 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-02-02 19:31:43,545 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 19:31:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-02-02 19:31:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-02-02 19:31:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-02-02 19:31:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 19:31:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 19:31:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 19:31:43,814 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 19:31:43,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:31:43 BoogieIcfgContainer [2018-02-02 19:31:43,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 19:31:43,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 19:31:43,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 19:31:43,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 19:31:43,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 07:31:43" (1/3) ... [2018-02-02 19:31:43,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c90de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:31:43, skipping insertion in model container [2018-02-02 19:31:43,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 07:31:43" (2/3) ... [2018-02-02 19:31:43,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c90de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 07:31:43, skipping insertion in model container [2018-02-02 19:31:43,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 07:31:43" (3/3) ... [2018-02-02 19:31:43,821 INFO L107 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-02-02 19:31:43,827 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 19:31:43,833 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-02 19:31:43,857 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 19:31:43,857 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 19:31:43,857 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 19:31:43,858 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 19:31:43,858 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 19:31:43,858 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 19:31:43,858 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 19:31:43,858 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 19:31:43,859 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 19:31:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-02-02 19:31:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 19:31:43,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:43,877 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:43,877 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-02-02 19:31:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-02-02 19:31:43,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:43,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:43,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:43,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:43,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:43,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:43,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:43,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:31:43,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:31:44,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:31:44,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:31:44,011 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-02-02 19:31:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:44,218 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 19:31:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:31:44,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 19:31:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:44,228 INFO L225 Difference]: With dead ends: 120 [2018-02-02 19:31:44,228 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 19:31:44,230 INFO L554 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-02-02 19:31:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 19:31:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-02 19:31:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 19:31:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-02 19:31:44,264 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-02-02 19:31:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:44,265 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-02 19:31:44,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:31:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-02 19:31:44,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 19:31:44,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:44,265 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:44,265 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-02-02 19:31:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-02-02 19:31:44,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:44,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:44,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:44,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:44,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:44,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:44,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 19:31:44,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 19:31:44,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 19:31:44,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 19:31:44,318 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-02-02 19:31:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:44,467 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-02-02 19:31:44,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 19:31:44,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 19:31:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:44,468 INFO L225 Difference]: With dead ends: 114 [2018-02-02 19:31:44,469 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 19:31:44,469 INFO L554 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-02-02 19:31:44,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 19:31:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 19:31:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 19:31:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-02-02 19:31:44,478 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-02-02 19:31:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:44,478 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-02-02 19:31:44,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 19:31:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-02-02 19:31:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:31:44,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:44,479 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:44,479 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-02-02 19:31:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-02-02 19:31:44,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:44,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:44,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,481 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:44,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:44,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:44,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:44,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:31:44,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 19:31:44,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 19:31:44,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 19:31:44,552 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-02-02 19:31:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:44,614 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-02-02 19:31:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 19:31:44,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 19:31:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:44,617 INFO L225 Difference]: With dead ends: 150 [2018-02-02 19:31:44,618 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 19:31:44,618 INFO L554 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-02-02 19:31:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 19:31:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-02-02 19:31:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 19:31:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-02-02 19:31:44,630 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-02-02 19:31:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:44,630 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-02-02 19:31:44,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 19:31:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-02-02 19:31:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:31:44,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:44,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:44,631 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-02-02 19:31:44,631 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-02-02 19:31:44,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:44,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:44,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,633 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:44,633 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:44,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:44,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:44,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:31:44,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:31:44,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:31:44,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:31:44,672 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-02-02 19:31:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:44,772 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-02-02 19:31:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:31:44,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 19:31:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:44,774 INFO L225 Difference]: With dead ends: 154 [2018-02-02 19:31:44,774 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 19:31:44,774 INFO L554 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-02-02 19:31:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 19:31:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-02-02 19:31:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 19:31:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-02-02 19:31:44,783 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-02-02 19:31:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:44,784 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-02-02 19:31:44,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:31:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-02-02 19:31:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 19:31:44,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:44,784 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:44,784 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-02-02 19:31:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-02-02 19:31:44,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:44,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:44,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,786 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:44,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:44,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:44,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:44,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:31:44,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:31:44,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:31:44,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:31:44,844 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-02-02 19:31:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:44,938 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-02-02 19:31:44,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:31:44,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 19:31:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:44,939 INFO L225 Difference]: With dead ends: 155 [2018-02-02 19:31:44,939 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 19:31:44,939 INFO L554 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-02-02 19:31:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 19:31:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-02-02 19:31:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 19:31:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-02-02 19:31:44,948 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-02-02 19:31:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:44,948 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-02-02 19:31:44,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:31:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-02-02 19:31:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:31:44,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:44,949 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:44,949 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-02-02 19:31:44,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-02-02 19:31:44,949 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:44,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:44,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:44,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:44,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:45,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:45,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:31:45,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:31:45,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:31:45,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:31:45,016 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 7 states. [2018-02-02 19:31:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:45,202 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2018-02-02 19:31:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:31:45,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-02 19:31:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:45,204 INFO L225 Difference]: With dead ends: 162 [2018-02-02 19:31:45,204 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 19:31:45,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:31:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 19:31:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 133. [2018-02-02 19:31:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 19:31:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-02-02 19:31:45,212 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-02-02 19:31:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:45,212 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-02-02 19:31:45,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:31:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-02-02 19:31:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 19:31:45,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:45,214 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:45,214 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-02-02 19:31:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-02-02 19:31:45,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:45,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:45,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:45,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:45,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:45,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:45,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 19:31:45,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:31:45,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:31:45,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:31:45,284 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-02-02 19:31:45,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:45,381 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-02-02 19:31:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 19:31:45,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 19:31:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:45,382 INFO L225 Difference]: With dead ends: 132 [2018-02-02 19:31:45,382 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 19:31:45,382 INFO L554 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-02-02 19:31:45,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 19:31:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-02 19:31:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 19:31:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-02-02 19:31:45,385 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-02-02 19:31:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:45,385 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-02-02 19:31:45,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:31:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-02-02 19:31:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:31:45,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:45,386 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:45,386 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-02-02 19:31:45,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-02-02 19:31:45,386 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:45,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:45,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,387 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:45,387 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:45,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:45,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:45,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:31:45,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:31:45,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:31:45,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:31:45,455 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-02-02 19:31:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:45,610 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2018-02-02 19:31:45,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:31:45,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 19:31:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:45,612 INFO L225 Difference]: With dead ends: 155 [2018-02-02 19:31:45,612 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 19:31:45,613 INFO L554 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-02-02 19:31:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 19:31:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-02-02 19:31:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:31:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-02-02 19:31:45,616 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-02-02 19:31:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:45,617 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-02-02 19:31:45,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:31:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-02-02 19:31:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 19:31:45,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:45,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:45,617 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-02-02 19:31:45,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-02-02 19:31:45,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:45,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:45,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:45,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:45,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:45,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:45,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:31:45,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:31:45,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:31:45,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:31:45,673 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-02-02 19:31:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:45,887 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-02-02 19:31:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:31:45,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-02 19:31:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:45,888 INFO L225 Difference]: With dead ends: 152 [2018-02-02 19:31:45,888 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 19:31:45,888 INFO L554 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-02-02 19:31:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 19:31:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-02-02 19:31:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 19:31:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-02-02 19:31:45,893 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-02-02 19:31:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:45,893 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-02-02 19:31:45,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:31:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-02-02 19:31:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:31:45,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:45,894 INFO L351 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-02-02 19:31:45,896 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-02-02 19:31:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-02-02 19:31:45,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:45,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:45,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,897 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:45,897 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:45,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:46,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:46,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 19:31:46,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 19:31:46,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 19:31:46,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 19:31:46,034 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-02-02 19:31:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:46,213 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2018-02-02 19:31:46,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 19:31:46,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 19:31:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:46,214 INFO L225 Difference]: With dead ends: 170 [2018-02-02 19:31:46,214 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 19:31:46,214 INFO L554 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-02-02 19:31:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 19:31:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-02-02 19:31:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 19:31:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-02-02 19:31:46,219 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-02-02 19:31:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:46,219 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-02-02 19:31:46,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 19:31:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-02-02 19:31:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:31:46,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:46,220 INFO L351 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-02-02 19:31:46,221 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-02-02 19:31:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-02-02 19:31:46,221 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:46,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:46,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:46,222 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:46,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:46,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:46,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:46,266 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 19:31:46,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:46,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:46,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:46,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 19:31:46,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:31:46,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:31:46,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:31:46,349 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 6 states. [2018-02-02 19:31:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:46,490 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-02-02 19:31:46,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:31:46,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 19:31:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:46,492 INFO L225 Difference]: With dead ends: 169 [2018-02-02 19:31:46,492 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 19:31:46,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:31:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 19:31:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-02 19:31:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 19:31:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-02-02 19:31:46,498 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 24 [2018-02-02 19:31:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:46,498 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-02-02 19:31:46,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:31:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-02-02 19:31:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 19:31:46,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:46,499 INFO L351 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-02-02 19:31:46,499 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-02-02 19:31:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 560220084, now seen corresponding path program 1 times [2018-02-02 19:31:46,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:46,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:46,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:46,501 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:46,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:46,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:46,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:46,683 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:31:46,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:46,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:46,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:46,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 15 [2018-02-02 19:31:46,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 19:31:46,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 19:31:46,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-02 19:31:46,802 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 16 states. [2018-02-02 19:31:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:47,099 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2018-02-02 19:31:47,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:31:47,099 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-02-02 19:31:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:47,100 INFO L225 Difference]: With dead ends: 168 [2018-02-02 19:31:47,100 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 19:31:47,100 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-02-02 19:31:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 19:31:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-02-02 19:31:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 19:31:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2018-02-02 19:31:47,105 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 24 [2018-02-02 19:31:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:47,105 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2018-02-02 19:31:47,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 19:31:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2018-02-02 19:31:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 19:31:47,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:47,106 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:47,107 INFO L371 AbstractCegarLoop]: === Iteration 13 === [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-02-02 19:31:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1681609457, now seen corresponding path program 1 times [2018-02-02 19:31:47,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:47,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:47,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:47,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:47,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:47,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:47,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:47,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 19:31:47,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:31:47,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:31:47,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:31:47,190 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand 8 states. [2018-02-02 19:31:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:47,384 INFO L93 Difference]: Finished difference Result 172 states and 208 transitions. [2018-02-02 19:31:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:31:47,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-02 19:31:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:47,385 INFO L225 Difference]: With dead ends: 172 [2018-02-02 19:31:47,385 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 19:31:47,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:31:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 19:31:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2018-02-02 19:31:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 19:31:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2018-02-02 19:31:47,390 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 26 [2018-02-02 19:31:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:47,390 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2018-02-02 19:31:47,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:31:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2018-02-02 19:31:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 19:31:47,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:47,391 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:47,391 INFO L371 AbstractCegarLoop]: === Iteration 14 === [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-02-02 19:31:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1579097554, now seen corresponding path program 1 times [2018-02-02 19:31:47,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:47,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:47,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:47,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:47,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:47,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:47,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:47,443 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:31:47,464 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:47,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:47,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 19:31:47,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:47,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:47,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 19:31:47,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:31:47,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 19:31:47,529 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 19:31:47,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:47,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:47,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-02-02 19:31:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:47,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:47,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-02-02 19:31:47,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 19:31:47,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 19:31:47,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:31:47,577 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand 8 states. [2018-02-02 19:31:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:47,854 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2018-02-02 19:31:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 19:31:47,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-02 19:31:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:47,855 INFO L225 Difference]: With dead ends: 187 [2018-02-02 19:31:47,856 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 19:31:47,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:31:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 19:31:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 164. [2018-02-02 19:31:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 19:31:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2018-02-02 19:31:47,861 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 29 [2018-02-02 19:31:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:47,861 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2018-02-02 19:31:47,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 19:31:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2018-02-02 19:31:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 19:31:47,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:47,862 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:47,863 INFO L371 AbstractCegarLoop]: === Iteration 15 === [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-02-02 19:31:47,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1385679684, now seen corresponding path program 1 times [2018-02-02 19:31:47,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:47,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:47,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:47,864 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:47,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:47,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:47,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:47,998 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:31:48,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:48,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:48,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:31:48,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:31:48,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:48,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:48,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:48,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-02-02 19:31:48,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 19:31:48,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-02-02 19:31:48,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:48,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:48,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:48,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-02-02 19:31:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:48,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:48,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-02-02 19:31:48,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 19:31:48,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 19:31:48,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-02 19:31:48,159 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand 19 states. [2018-02-02 19:31:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:48,946 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-02-02 19:31:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 19:31:48,946 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-02-02 19:31:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:48,947 INFO L225 Difference]: With dead ends: 243 [2018-02-02 19:31:48,947 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 19:31:48,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1153, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 19:31:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 19:31:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 205. [2018-02-02 19:31:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 19:31:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 242 transitions. [2018-02-02 19:31:48,954 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 242 transitions. Word has length 30 [2018-02-02 19:31:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:48,954 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 242 transitions. [2018-02-02 19:31:48,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 19:31:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 242 transitions. [2018-02-02 19:31:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:31:48,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:48,955 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:48,955 INFO L371 AbstractCegarLoop]: === Iteration 16 === [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-02-02 19:31:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902430, now seen corresponding path program 1 times [2018-02-02 19:31:48,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:48,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:48,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:48,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:48,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:48,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:49,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:49,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 19:31:49,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 19:31:49,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 19:31:49,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 19:31:49,026 INFO L87 Difference]: Start difference. First operand 205 states and 242 transitions. Second operand 6 states. [2018-02-02 19:31:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:49,218 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2018-02-02 19:31:49,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 19:31:49,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 19:31:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:49,220 INFO L225 Difference]: With dead ends: 240 [2018-02-02 19:31:49,220 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 19:31:49,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:31:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 19:31:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2018-02-02 19:31:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 19:31:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 241 transitions. [2018-02-02 19:31:49,225 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 241 transitions. Word has length 31 [2018-02-02 19:31:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:49,225 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 241 transitions. [2018-02-02 19:31:49,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 19:31:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 241 transitions. [2018-02-02 19:31:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 19:31:49,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:49,226 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:49,226 INFO L371 AbstractCegarLoop]: === Iteration 17 === [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-02-02 19:31:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902431, now seen corresponding path program 1 times [2018-02-02 19:31:49,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:49,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:49,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:49,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:49,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:49,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 19:31:49,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:49,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 19:31:49,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 19:31:49,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 19:31:49,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:31:49,252 INFO L87 Difference]: Start difference. First operand 204 states and 241 transitions. Second operand 4 states. [2018-02-02 19:31:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:49,279 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2018-02-02 19:31:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 19:31:49,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 19:31:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:49,281 INFO L225 Difference]: With dead ends: 215 [2018-02-02 19:31:49,281 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 19:31:49,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 19:31:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 19:31:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204. [2018-02-02 19:31:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 19:31:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 239 transitions. [2018-02-02 19:31:49,287 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 239 transitions. Word has length 31 [2018-02-02 19:31:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:49,287 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 239 transitions. [2018-02-02 19:31:49,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 19:31:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 239 transitions. [2018-02-02 19:31:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:31:49,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:49,288 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:49,288 INFO L371 AbstractCegarLoop]: === Iteration 18 === [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-02-02 19:31:49,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636396, now seen corresponding path program 1 times [2018-02-02 19:31:49,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:49,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:49,289 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:49,289 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:49,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:49,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:49,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:49,773 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:31:49,793 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:49,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:49,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:31:49,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:31:49,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:49,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:49,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:31:49,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-02 19:31:50,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-02 19:31:50,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2018-02-02 19:31:50,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:31:50,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:31:50,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 19:31:50,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:24 [2018-02-02 19:31:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:50,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:50,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-02-02 19:31:50,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 19:31:50,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 19:31:50,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-02-02 19:31:50,127 INFO L87 Difference]: Start difference. First operand 204 states and 239 transitions. Second operand 26 states. [2018-02-02 19:31:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:52,291 INFO L93 Difference]: Finished difference Result 391 states and 473 transitions. [2018-02-02 19:31:52,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 19:31:52,292 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-02 19:31:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:52,293 INFO L225 Difference]: With dead ends: 391 [2018-02-02 19:31:52,293 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 19:31:52,293 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 19:31:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 19:31:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 286. [2018-02-02 19:31:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-02 19:31:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2018-02-02 19:31:52,298 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 33 [2018-02-02 19:31:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:52,298 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2018-02-02 19:31:52,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 19:31:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2018-02-02 19:31:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 19:31:52,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:52,299 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:52,299 INFO L371 AbstractCegarLoop]: === Iteration 19 === [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-02-02 19:31:52,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636395, now seen corresponding path program 1 times [2018-02-02 19:31:52,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:52,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:52,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:52,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:52,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:52,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:52,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:52,716 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:31:52,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:52,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:52,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:31:52,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:31:52,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:31:52,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:31:52,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:38 [2018-02-02 19:31:52,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-02-02 19:31:52,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-02-02 19:31:52,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-02-02 19:31:52,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-02-02 19:31:52,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:52,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:14 [2018-02-02 19:31:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:52,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:52,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-02-02 19:31:52,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 19:31:52,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 19:31:52,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=621, Unknown=3, NotChecked=0, Total=702 [2018-02-02 19:31:52,994 INFO L87 Difference]: Start difference. First operand 286 states and 349 transitions. Second operand 27 states. [2018-02-02 19:31:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:55,080 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2018-02-02 19:31:55,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 19:31:55,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-02-02 19:31:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:55,082 INFO L225 Difference]: With dead ends: 398 [2018-02-02 19:31:55,082 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 19:31:55,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=369, Invalid=2068, Unknown=13, NotChecked=0, Total=2450 [2018-02-02 19:31:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 19:31:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 322. [2018-02-02 19:31:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 19:31:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 395 transitions. [2018-02-02 19:31:55,090 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 395 transitions. Word has length 33 [2018-02-02 19:31:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:55,090 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 395 transitions. [2018-02-02 19:31:55,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 19:31:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 395 transitions. [2018-02-02 19:31:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:31:55,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:55,091 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:55,091 INFO L371 AbstractCegarLoop]: === Iteration 20 === [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-02-02 19:31:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217638, now seen corresponding path program 1 times [2018-02-02 19:31:55,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:55,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:55,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:55,092 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:55,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:55,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:55,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:55,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:31:55,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:31:55,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:31:55,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:31:55,148 INFO L87 Difference]: Start difference. First operand 322 states and 395 transitions. Second operand 7 states. [2018-02-02 19:31:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:55,326 INFO L93 Difference]: Finished difference Result 357 states and 433 transitions. [2018-02-02 19:31:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:31:55,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 19:31:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:55,327 INFO L225 Difference]: With dead ends: 357 [2018-02-02 19:31:55,328 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 19:31:55,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:31:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 19:31:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2018-02-02 19:31:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 19:31:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 425 transitions. [2018-02-02 19:31:55,337 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 425 transitions. Word has length 36 [2018-02-02 19:31:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:55,337 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 425 transitions. [2018-02-02 19:31:55,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:31:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 425 transitions. [2018-02-02 19:31:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 19:31:55,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:55,338 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:55,338 INFO L371 AbstractCegarLoop]: === Iteration 21 === [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-02-02 19:31:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217639, now seen corresponding path program 1 times [2018-02-02 19:31:55,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:55,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:55,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:55,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:55,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:55,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:55,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:31:55,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:31:55,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:31:55,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:31:55,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:31:55,389 INFO L87 Difference]: Start difference. First operand 342 states and 425 transitions. Second operand 7 states. [2018-02-02 19:31:55,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:31:55,550 INFO L93 Difference]: Finished difference Result 347 states and 419 transitions. [2018-02-02 19:31:55,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:31:55,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 19:31:55,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:31:55,552 INFO L225 Difference]: With dead ends: 347 [2018-02-02 19:31:55,552 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 19:31:55,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 19:31:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 19:31:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 339. [2018-02-02 19:31:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 19:31:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 413 transitions. [2018-02-02 19:31:55,559 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 413 transitions. Word has length 36 [2018-02-02 19:31:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:31:55,559 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 413 transitions. [2018-02-02 19:31:55,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:31:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 413 transitions. [2018-02-02 19:31:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 19:31:55,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:31:55,560 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:31:55,560 INFO L371 AbstractCegarLoop]: === Iteration 22 === [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-02-02 19:31:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1964561354, now seen corresponding path program 1 times [2018-02-02 19:31:55,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:31:55,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:31:55,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:55,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:55,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:31:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:55,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:31:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:55,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 19:31:55,872 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 19:31:55,877 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:31:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:31:55,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 19:31:55,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-02 19:31:55,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-02 19:31:55,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 19:31:55,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 19:31:55,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 19:31:55,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-02-02 19:31:58,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 19:31:58,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-02-02 19:31:58,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 19:31:58,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:31:58,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 19:31:58,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2018-02-02 19:31:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:31:58,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 19:31:58,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-02 19:31:58,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 19:31:58,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 19:31:58,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=530, Unknown=1, NotChecked=0, Total=600 [2018-02-02 19:31:58,170 INFO L87 Difference]: Start difference. First operand 339 states and 413 transitions. Second operand 25 states. [2018-02-02 19:33:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:33:24,502 INFO L93 Difference]: Finished difference Result 410 states and 493 transitions. [2018-02-02 19:33:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 19:33:24,503 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2018-02-02 19:33:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:33:24,504 INFO L225 Difference]: With dead ends: 410 [2018-02-02 19:33:24,504 INFO L226 Difference]: Without dead ends: 409 [2018-02-02 19:33:24,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=340, Invalid=1720, Unknown=10, NotChecked=0, Total=2070 [2018-02-02 19:33:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-02-02 19:33:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 316. [2018-02-02 19:33:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 19:33:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2018-02-02 19:33:24,511 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 35 [2018-02-02 19:33:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:33:24,511 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2018-02-02 19:33:24,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 19:33:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2018-02-02 19:33:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 19:33:24,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:33:24,512 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:33:24,512 INFO L371 AbstractCegarLoop]: === Iteration 23 === [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-02-02 19:33:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash -137022243, now seen corresponding path program 1 times [2018-02-02 19:33:24,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:33:24,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:33:24,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:33:24,513 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:33:24,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:33:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:33:24,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:33:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 19:33:24,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:33:24,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 19:33:24,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 19:33:24,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 19:33:24,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 19:33:24,578 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand 7 states. [2018-02-02 19:33:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:33:24,766 INFO L93 Difference]: Finished difference Result 332 states and 399 transitions. [2018-02-02 19:33:24,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 19:33:24,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 19:33:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:33:24,767 INFO L225 Difference]: With dead ends: 332 [2018-02-02 19:33:24,767 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 19:33:24,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:33:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 19:33:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 310. [2018-02-02 19:33:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 19:33:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 374 transitions. [2018-02-02 19:33:24,771 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 374 transitions. Word has length 38 [2018-02-02 19:33:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:33:24,771 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 374 transitions. [2018-02-02 19:33:24,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 19:33:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 374 transitions. [2018-02-02 19:33:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:33:24,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:33:24,772 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:33:24,772 INFO L371 AbstractCegarLoop]: === Iteration 24 === [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-02-02 19:33:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1296859951, now seen corresponding path program 1 times [2018-02-02 19:33:24,772 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:33:24,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:33:24,772 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:33:24,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:33:24,773 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:33:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:33:24,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 19:33:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 19:33:24,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 19:33:24,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 19:33:24,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 19:33:24,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 19:33:24,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 19:33:24,901 INFO L87 Difference]: Start difference. First operand 310 states and 374 transitions. Second operand 10 states. [2018-02-02 19:33:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 19:33:25,222 INFO L93 Difference]: Finished difference Result 377 states and 459 transitions. [2018-02-02 19:33:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 19:33:25,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-02 19:33:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 19:33:25,224 INFO L225 Difference]: With dead ends: 377 [2018-02-02 19:33:25,224 INFO L226 Difference]: Without dead ends: 377 [2018-02-02 19:33:25,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-02 19:33:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-02 19:33:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 350. [2018-02-02 19:33:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 19:33:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 428 transitions. [2018-02-02 19:33:25,231 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 428 transitions. Word has length 39 [2018-02-02 19:33:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 19:33:25,232 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 428 transitions. [2018-02-02 19:33:25,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 19:33:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 428 transitions. [2018-02-02 19:33:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 19:33:25,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 19:33:25,233 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 19:33:25,233 INFO L371 AbstractCegarLoop]: === Iteration 25 === [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-02-02 19:33:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 190013480, now seen corresponding path program 1 times [2018-02-02 19:33:25,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 19:33:25,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 19:33:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:33:25,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 19:33:25,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 19:33:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 19:33:25,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 19:33:25,431 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 19:33:25,435 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 19:33:25,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 07:33:25 BoogieIcfgContainer [2018-02-02 19:33:25,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 19:33:25,436 INFO L168 Benchmark]: Toolchain (without parser) took 102144.88 ms. Allocated memory was 405.3 MB in the beginning and 796.4 MB in the end (delta: 391.1 MB). Free memory was 362.2 MB in the beginning and 736.5 MB in the end (delta: -374.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:33:25,436 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:33:25,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.52 ms. Allocated memory is still 405.3 MB. Free memory was 362.2 MB in the beginning and 351.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 19:33:25,437 INFO L168 Benchmark]: Boogie Preprocessor took 29.70 ms. Allocated memory is still 405.3 MB. Free memory was 351.6 MB in the beginning and 348.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 19:33:25,437 INFO L168 Benchmark]: RCFGBuilder took 313.76 ms. Allocated memory is still 405.3 MB. Free memory was 348.9 MB in the beginning and 316.0 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. [2018-02-02 19:33:25,437 INFO L168 Benchmark]: TraceAbstraction took 101619.93 ms. Allocated memory was 405.3 MB in the beginning and 796.4 MB in the end (delta: 391.1 MB). Free memory was 316.0 MB in the beginning and 736.5 MB in the end (delta: -420.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 19:33:25,438 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.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 178.52 ms. Allocated memory is still 405.3 MB. Free memory was 362.2 MB in the beginning and 351.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.70 ms. Allocated memory is still 405.3 MB. Free memory was 351.6 MB in the beginning and 348.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 313.76 ms. Allocated memory is still 405.3 MB. Free memory was 348.9 MB in the beginning and 316.0 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 101619.93 ms. Allocated memory was 405.3 MB in the beginning and 796.4 MB in the end (delta: 391.1 MB). Free memory was 316.0 MB in the beginning and 736.5 MB in the end (delta: -420.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 591). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 598). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 587]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 587). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 584). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 122 locations, 43 error locations. TIMEOUT Result, 101.5s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 94.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2948 SDtfs, 2892 SDslu, 11791 SDs, 0 SdLazy, 9919 SolverSat, 1569 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 72.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 194 SyntacticMatches, 22 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 579 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 779 ConstructedInterpolants, 31 QuantifiedInterpolants, 206144 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 11/44 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_19-33-25-443.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_19-33-25-443.csv Completed graceful shutdown