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_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:04:12,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:04:12,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:04:12,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:04:12,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:04:12,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:04:12,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:04:12,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:04:12,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:04:12,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:04:12,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:04:12,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:04:12,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:04:12,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:04:12,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:04:12,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:04:12,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:04:12,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:04:12,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:04:12,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:04:12,826 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:04:12,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:04:12,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:04:12,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:04:12,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:04:12,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:04:12,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:04:12,830 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:04:12,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:04:12,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:04:12,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:04:12,831 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:04:12,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:04:12,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:04:12,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:04:12,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:04:12,842 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:04:12,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:04:12,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:04:12,842 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:04:12,842 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:04:12,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:04:12,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:04:12,843 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:04:12,843 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:04:12,843 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:04:12,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:04:12,843 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:04:12,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:04:12,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:04:12,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:04:12,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:04:12,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:04:12,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:04:12,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:04:12,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:04:12,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:04:12,891 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:04:12,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:04:12,893 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:04:12,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i [2018-02-02 20:04:13,025 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:04:13,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:04:13,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:04:13,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:04:13,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:04:13,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d467652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13, skipping insertion in model container [2018-02-02 20:04:13,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,049 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:04:13,078 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:04:13,181 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:04:13,199 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:04:13,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13 WrapperNode [2018-02-02 20:04:13,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:04:13,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:04:13,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:04:13,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:04:13,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (1/1) ... [2018-02-02 20:04:13,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:04:13,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:04:13,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:04:13,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:04:13,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (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 20:04:13,278 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:04:13,278 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:04:13,278 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-02 20:04:13,278 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-02 20:04:13,279 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:04:13,279 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-02 20:04:13,280 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:04:13,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:04:13,718 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:04:13,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:04:13 BoogieIcfgContainer [2018-02-02 20:04:13,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:04:13,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:04:13,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:04:13,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:04:13,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:04:13" (1/3) ... [2018-02-02 20:04:13,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e158516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:04:13, skipping insertion in model container [2018-02-02 20:04:13,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:04:13" (2/3) ... [2018-02-02 20:04:13,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e158516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:04:13, skipping insertion in model container [2018-02-02 20:04:13,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:04:13" (3/3) ... [2018-02-02 20:04:13,724 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-02-02 20:04:13,729 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:04:13,735 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 20:04:13,760 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:04:13,761 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:04:13,761 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:04:13,761 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:04:13,761 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:04:13,761 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:04:13,761 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:04:13,761 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:04:13,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:04:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-02-02 20:04:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 20:04:13,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:13,784 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 20:04:13,784 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-02-02 20:04:13,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:13,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:13,915 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 20:04:13,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:13,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:04:13,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:13,918 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 20:04:13,918 INFO L182 omatonBuilderFactory]: Interpolants [182#true, 183#false, 184#(= 1 (select |#valid| |~#gl_list.base|))] [2018-02-02 20:04:13,918 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 20:04:13,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:04:13,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:04:13,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:04:13,929 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-02-02 20:04:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:14,119 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-02 20:04:14,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:04:14,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 20:04:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:14,128 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:04:14,128 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 20:04:14,129 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 20:04:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 20:04:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-02-02 20:04:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:04:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-02 20:04:14,172 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-02-02 20:04:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:14,172 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-02 20:04:14,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:04:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-02 20:04:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 20:04:14,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:14,173 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 20:04:14,173 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-02-02 20:04:14,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:14,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:14,216 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 20:04:14,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:14,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:04:14,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:14,217 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 20:04:14,217 INFO L182 omatonBuilderFactory]: Interpolants [545#true, 546#false, 547#(and (= (select |#length| |~#gl_list.base|) 8) (= |~#gl_list.offset| 0))] [2018-02-02 20:04:14,217 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 20:04:14,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:04:14,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:04:14,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:04:14,218 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-02-02 20:04:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:14,283 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-02-02 20:04:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:04:14,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 20:04:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:14,285 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:04:14,285 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 20:04:14,285 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 20:04:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 20:04:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-02 20:04:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:04:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-02-02 20:04:14,293 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-02-02 20:04:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:14,294 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-02-02 20:04:14,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:04:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-02-02 20:04:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:04:14,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:14,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:14,294 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:14,294 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-02-02 20:04:14,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:14,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:14,338 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 20:04:14,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:14,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:04:14,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:14,339 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 20:04:14,339 INFO L182 omatonBuilderFactory]: Interpolants [904#true, 905#false, 906#(= 1 (select |#valid| |gl_insert_#t~malloc14.base|)), 907#(= 1 (select |#valid| gl_insert_~node~0.base))] [2018-02-02 20:04:14,339 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 20:04:14,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:04:14,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:04:14,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:04:14,340 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-02-02 20:04:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:14,493 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-02-02 20:04:14,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:04:14,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 20:04:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:14,494 INFO L225 Difference]: With dead ends: 175 [2018-02-02 20:04:14,494 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 20:04:14,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:04:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 20:04:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-02 20:04:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:04:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-02 20:04:14,503 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-02-02 20:04:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:14,503 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-02 20:04:14,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:04:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-02 20:04:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:04:14,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:14,504 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:14,504 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-02-02 20:04:14,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:14,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:14,591 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 20:04:14,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:14,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:04:14,591 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:14,592 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 20:04:14,592 INFO L182 omatonBuilderFactory]: Interpolants [1260#true, 1261#false, 1262#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 1263#(and (= (select |#length| gl_insert_~node~0.base) 12) (= 0 gl_insert_~node~0.offset))] [2018-02-02 20:04:14,592 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 20:04:14,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:04:14,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:04:14,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:04:14,593 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-02-02 20:04:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:14,699 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-02 20:04:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:04:14,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 20:04:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:14,701 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:04:14,701 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:04:14,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 20:04:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:04:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-02 20:04:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:04:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 20:04:14,708 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-02-02 20:04:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:14,708 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 20:04:14,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:04:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 20:04:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:04:14,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:14,709 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:14,709 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-02-02 20:04:14,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:14,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:14,848 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 20:04:14,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:14,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:04:14,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:14,848 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 20:04:14,848 INFO L182 omatonBuilderFactory]: Interpolants [1616#(= 1 (select |#valid| |~#gl_list.base|)), 1617#(or (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| |gl_insert_#t~malloc14.base|)), 1618#(or (= 1 (select |#valid| |~#gl_list.base|)) (= gl_insert_~node~0.base |~#gl_list.base|)), 1619#(= 1 (select |#valid| |list_add_#in~head.base|)), 1620#(= 1 (select |#valid| list_add_~head.base)), 1614#true, 1615#false] [2018-02-02 20:04:14,848 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 20:04:14,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:04:14,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:04:14,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:04:14,849 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 7 states. [2018-02-02 20:04:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:15,084 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-02 20:04:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:04:15,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 20:04:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:15,086 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:04:15,086 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:04:15,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:04:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:04:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-02 20:04:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 20:04:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-02-02 20:04:15,091 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-02-02 20:04:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:15,091 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-02-02 20:04:15,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:04:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-02-02 20:04:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:04:15,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:15,092 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:15,092 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-02-02 20:04:15,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:15,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:15,249 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 20:04:15,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:15,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:04:15,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:15,250 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 20:04:15,251 INFO L182 omatonBuilderFactory]: Interpolants [1989#true, 1990#false, 1991#(and (= 0 |~#gl_list.offset|) (= (select |#length| |~#gl_list.base|) 8)), 1992#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|) (= (select |#length| |~#gl_list.base|) 8)), 1993#(and (<= 8 (select |#length| |~#gl_list.base|)) (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|)), 1994#(and (<= 8 (select |#length| |~#gl_list.base|)) (= 0 |~#gl_list.offset|) (not (= |~#gl_list.base| |gl_insert_#t~malloc14.base|))), 1995#(and (<= 8 (select |#length| |~#gl_list.base|)) (= 0 |~#gl_list.offset|)), 1996#(and (= 0 |list_add_#in~head.offset|) (<= 8 (select |#length| |list_add_#in~head.base|))), 1997#(and (<= 8 (select |#length| list_add_~head.base)) (= list_add_~head.offset 0))] [2018-02-02 20:04:15,251 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 20:04:15,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:04:15,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:04:15,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:04:15,251 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 9 states. [2018-02-02 20:04:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:15,580 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-02-02 20:04:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:04:15,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 20:04:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:15,581 INFO L225 Difference]: With dead ends: 177 [2018-02-02 20:04:15,581 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 20:04:15,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:04:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 20:04:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-02 20:04:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 20:04:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-02-02 20:04:15,587 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 19 [2018-02-02 20:04:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:15,587 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-02-02 20:04:15,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:04:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-02-02 20:04:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:04:15,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:15,588 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] [2018-02-02 20:04:15,588 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-02-02 20:04:15,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:15,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:15,698 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 20:04:15,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:15,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:04:15,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:15,698 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 20:04:15,699 INFO L182 omatonBuilderFactory]: Interpolants [2358#true, 2359#false, 2360#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.base| (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|))), 2361#(and (not (= |~#gl_list.base| |gl_insert_#t~malloc14.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2362#(and (not (= |~#gl_list.base| gl_insert_~node~0.base)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2363#(= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 2364#(= list_add_~head.base (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)), 2365#(= 1 (select |#valid| |list_add_#t~mem7.base|)), 2366#(= 1 (select |#valid| |__list_add_#in~next.base|)), 2367#(= 1 (select |#valid| __list_add_~next.base))] [2018-02-02 20:04:15,699 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 20:04:15,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:04:15,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:04:15,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:04:15,699 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 10 states. [2018-02-02 20:04:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:16,007 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-02-02 20:04:16,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:04:16,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 20:04:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:16,009 INFO L225 Difference]: With dead ends: 203 [2018-02-02 20:04:16,009 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 20:04:16,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:04:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 20:04:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2018-02-02 20:04:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:04:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-02-02 20:04:16,016 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 22 [2018-02-02 20:04:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:16,016 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-02-02 20:04:16,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:04:16,016 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-02-02 20:04:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:04:16,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:16,017 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] [2018-02-02 20:04:16,017 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:16,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-02-02 20:04:16,018 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:16,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:16,213 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 20:04:16,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:16,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:04:16,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:16,214 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 20:04:16,214 INFO L182 omatonBuilderFactory]: Interpolants [2784#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 2785#(and (= (select |#valid| |~#gl_list.base|) 1) (= 8 (select |#length| |~#gl_list.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.offset|) |~#gl_list.offset|)) (= |~#gl_list.base| (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|))), 2786#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.base| |gl_insert_#t~malloc14.base|)) (= 8 (select |#length| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2787#(and (= 0 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= 8 (select |#length| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~0.base)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2788#(and (= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (= 8 (select |#length| |list_add_#in~head.base|))), 2789#(and (= 0 (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= 8 (select |#length| list_add_~head.base)) (= list_add_~head.base (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))), 2790#(and (= 8 (select |#length| list_add_~head.base)) (= list_add_~head.base |list_add_#t~mem7.base|) (= 0 |list_add_#t~mem7.offset|)), 2791#(and (= 8 (select |#length| |__list_add_#in~next.base|)) (= 0 |__list_add_#in~next.offset|)), 2792#(and (= __list_add_~next.offset 0) (= 8 (select |#length| __list_add_~next.base))), 2782#true, 2783#false] [2018-02-02 20:04:16,214 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 20:04:16,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:04:16,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:04:16,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:04:16,215 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 11 states. [2018-02-02 20:04:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:17,192 INFO L93 Difference]: Finished difference Result 362 states and 386 transitions. [2018-02-02 20:04:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:04:17,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 20:04:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:17,194 INFO L225 Difference]: With dead ends: 362 [2018-02-02 20:04:17,194 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 20:04:17,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:04:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 20:04:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 290. [2018-02-02 20:04:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 20:04:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 356 transitions. [2018-02-02 20:04:17,215 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 356 transitions. Word has length 22 [2018-02-02 20:04:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:17,215 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 356 transitions. [2018-02-02 20:04:17,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:04:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 356 transitions. [2018-02-02 20:04:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:04:17,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:17,216 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] [2018-02-02 20:04:17,216 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-02-02 20:04:17,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:17,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:17,264 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 20:04:17,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:17,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:04:17,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:17,265 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 20:04:17,265 INFO L182 omatonBuilderFactory]: Interpolants [3465#true, 3466#false, 3467#(= 1 (select |#valid| gl_insert_~node~0.base)), 3468#(= 1 (select |#valid| |list_add_#in~new.base|)), 3469#(= 1 (select |#valid| list_add_~new.base)), 3470#(= 1 (select |#valid| |__list_add_#in~new.base|)), 3471#(= 1 (select |#valid| __list_add_~new.base))] [2018-02-02 20:04:17,265 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 20:04:17,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:04:17,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:04:17,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:04:17,266 INFO L87 Difference]: Start difference. First operand 290 states and 356 transitions. Second operand 7 states. [2018-02-02 20:04:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:17,448 INFO L93 Difference]: Finished difference Result 302 states and 364 transitions. [2018-02-02 20:04:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:04:17,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 20:04:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:17,450 INFO L225 Difference]: With dead ends: 302 [2018-02-02 20:04:17,450 INFO L226 Difference]: Without dead ends: 302 [2018-02-02 20:04:17,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:04:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-02 20:04:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2018-02-02 20:04:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:04:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-02 20:04:17,455 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 23 [2018-02-02 20:04:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:17,456 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-02 20:04:17,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:04:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-02 20:04:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:04:17,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:17,456 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] [2018-02-02 20:04:17,456 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-02-02 20:04:17,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:17,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:17,536 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 20:04:17,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:17,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:04:17,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:17,536 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 20:04:17,536 INFO L182 omatonBuilderFactory]: Interpolants [3984#true, 3985#false, 3986#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 3987#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 3988#(and (<= 4 |list_add_#in~new.offset|) (= 12 (select |#length| |list_add_#in~new.base|)) (<= |list_add_#in~new.offset| 4)), 3989#(and (<= 4 list_add_~new.offset) (<= list_add_~new.offset 4) (= 12 (select |#length| list_add_~new.base))), 3990#(and (= 12 (select |#length| |__list_add_#in~new.base|)) (<= 4 |__list_add_#in~new.offset|) (<= |__list_add_#in~new.offset| 4)), 3991#(and (= (select |#length| __list_add_~new.base) 12) (<= __list_add_~new.offset 4) (<= 4 __list_add_~new.offset))] [2018-02-02 20:04:17,537 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 20:04:17,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:04:17,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:04:17,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:04:17,537 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 8 states. [2018-02-02 20:04:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:17,728 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-02 20:04:17,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:04:17,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 20:04:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:17,730 INFO L225 Difference]: With dead ends: 210 [2018-02-02 20:04:17,730 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 20:04:17,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:04:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 20:04:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-02-02 20:04:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:04:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-02-02 20:04:17,734 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 23 [2018-02-02 20:04:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:17,735 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-02-02 20:04:17,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:04:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-02-02 20:04:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:04:17,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:17,736 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] [2018-02-02 20:04:17,736 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-02-02 20:04:17,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:17,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:17,773 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 20:04:17,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:17,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:04:17,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:17,773 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 20:04:17,774 INFO L182 omatonBuilderFactory]: Interpolants [4416#(= 1 (select |#valid| list_add_~head.base)), 4417#(= 1 (select |#valid| |__list_add_#in~prev.base|)), 4418#(= 1 (select |#valid| __list_add_~prev.base)), 4414#true, 4415#false] [2018-02-02 20:04:17,774 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 20:04:17,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:04:17,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:04:17,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:04:17,774 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 5 states. [2018-02-02 20:04:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:17,887 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-02-02 20:04:17,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:04:17,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 20:04:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:17,889 INFO L225 Difference]: With dead ends: 205 [2018-02-02 20:04:17,890 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 20:04:17,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 20:04:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 20:04:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-02 20:04:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 20:04:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-02-02 20:04:17,908 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 25 [2018-02-02 20:04:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:17,908 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-02-02 20:04:17,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:04:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-02-02 20:04:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:04:17,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:17,909 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] [2018-02-02 20:04:17,909 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-02-02 20:04:17,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:17,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:17,999 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 20:04:17,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:17,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:04:17,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:18,000 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 20:04:18,000 INFO L182 omatonBuilderFactory]: Interpolants [4832#false, 4833#(= 0 |~#gl_list.offset|), 4834#(= 0 |list_add_#in~head.offset|), 4835#(= 0 list_add_~head.offset), 4836#(and (= 0 list_add_~head.offset) (<= (+ list_add_~head.offset 4) (select |#length| list_add_~head.base))), 4837#(and (= 0 |__list_add_#in~prev.offset|) (<= 4 (select |#length| |__list_add_#in~prev.base|))), 4838#(and (= __list_add_~prev.offset 0) (<= 4 (select |#length| __list_add_~prev.base))), 4831#true] [2018-02-02 20:04:18,000 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 20:04:18,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:04:18,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:04:18,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:04:18,001 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-02-02 20:04:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:18,167 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-02-02 20:04:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:04:18,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 20:04:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:18,168 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:04:18,168 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:04:18,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:04:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:04:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-02 20:04:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 20:04:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-02-02 20:04:18,174 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 25 [2018-02-02 20:04:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:18,175 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-02-02 20:04:18,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:04:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-02-02 20:04:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:04:18,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:18,176 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, 1, 1] [2018-02-02 20:04:18,176 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-02-02 20:04:18,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:18,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:18,266 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 20:04:18,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:18,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:04:18,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:18,267 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 20:04:18,267 INFO L182 omatonBuilderFactory]: Interpolants [5264#(= __list_add_~prev.base |__list_add_#in~prev.base|), 5265#(= 1 (select |#valid| |__list_add_#in~prev.base|)), 5266#(= 1 (select |#valid| |list_add_#in~head.base|)), 5267#(= 1 (select |#valid| |~#gl_list.base|)), 5268#(= 1 (select |#valid| |list_empty_#in~head.base|)), 5269#(= 1 (select |#valid| list_empty_~head.base)), 5261#true, 5262#false, 5263#(= list_add_~head.base |list_add_#in~head.base|)] [2018-02-02 20:04:18,267 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 20:04:18,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:04:18,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:04:18,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:04:18,268 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 9 states. [2018-02-02 20:04:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:18,565 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-02-02 20:04:18,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:04:18,566 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-02 20:04:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:18,567 INFO L225 Difference]: With dead ends: 204 [2018-02-02 20:04:18,567 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 20:04:18,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:04:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 20:04:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-02-02 20:04:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:04:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-02-02 20:04:18,573 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 41 [2018-02-02 20:04:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:18,574 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-02-02 20:04:18,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:04:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-02-02 20:04:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:04:18,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:18,575 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, 1, 1] [2018-02-02 20:04:18,575 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-02-02 20:04:18,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:18,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:04:18,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:18,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:04:18,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:18,732 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 20:04:18,732 INFO L182 omatonBuilderFactory]: Interpolants [5696#(and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~prev.offset 0)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 5697#(or (<= 4 (select |#length| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~prev.offset| 0))), 5698#(or (<= 4 (select |#length| |list_add_#in~head.base|)) (not (= |list_add_#in~head.offset| 0))), 5699#(or (<= 4 (select |#length| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0))), 5700#(and (= 0 |~#gl_list.offset|) (<= 4 (select |#length| |~#gl_list.base|))), 5701#(and (<= 4 (select |#length| |list_empty_#in~head.base|)) (= 0 |list_empty_#in~head.offset|)), 5702#(and (= list_empty_~head.offset 0) (<= 4 (select |#length| list_empty_~head.base))), 5692#true, 5693#false, 5694#(= 0 |~#gl_list.offset|), 5695#(and (= list_add_~head.base |list_add_#in~head.base|) (= |list_add_#in~head.offset| list_add_~head.offset))] [2018-02-02 20:04:18,732 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 20:04:18,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:04:18,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:04:18,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:04:18,733 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 11 states. [2018-02-02 20:04:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:19,141 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-02-02 20:04:19,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:04:19,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 20:04:19,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:19,142 INFO L225 Difference]: With dead ends: 203 [2018-02-02 20:04:19,142 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 20:04:19,142 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:04:19,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 20:04:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-02 20:04:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 20:04:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-02-02 20:04:19,149 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 41 [2018-02-02 20:04:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:19,150 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-02-02 20:04:19,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:04:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-02-02 20:04:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:04:19,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:19,151 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:19,151 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-02-02 20:04:19,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:19,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:04:19,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:04:19,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:04:19,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:04:19,456 INFO L182 omatonBuilderFactory]: Interpolants [6123#true, 6124#false, 6125#(= 1 (select |#valid| gl_insert_~node~0.base)), 6126#(and (= |list_add_#in~head.base| list_add_~head.base) (= list_add_~head.offset |list_add_#in~head.offset|) (= |list_add_#in~new.base| list_add_~new.base)), 6127#(and (= |list_add_#in~head.base| list_add_~head.base) (= list_add_~head.offset |list_add_#in~head.offset|) (= |list_add_#in~new.base| list_add_~new.base) (= (select |#valid| list_add_~head.base) 1)), 6128#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 6129#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 6130#(and (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 6131#(and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 6132#(and (or (= |gl_insert_#t~malloc14.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| |gl_insert_#t~malloc14.base|))), 6133#(and (not (= gl_insert_~node~0.base |~#gl_list.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= gl_insert_~node~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 6134#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 6135#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 6136#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))), 6137#(= 1 (select |#valid| |list_add_#t~mem7.base|)), 6138#(= 1 (select |#valid| |__list_add_#in~next.base|)), 6139#(= 1 (select |#valid| __list_add_~next.base))] [2018-02-02 20:04:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:04:19,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:04:19,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:04:19,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:04:19,457 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand 17 states. [2018-02-02 20:04:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:20,192 INFO L93 Difference]: Finished difference Result 277 states and 297 transitions. [2018-02-02 20:04:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:04:20,192 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-02-02 20:04:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:20,193 INFO L225 Difference]: With dead ends: 277 [2018-02-02 20:04:20,193 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 20:04:20,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:04:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 20:04:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 238. [2018-02-02 20:04:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 20:04:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 261 transitions. [2018-02-02 20:04:20,200 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 261 transitions. Word has length 48 [2018-02-02 20:04:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:20,200 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 261 transitions. [2018-02-02 20:04:20,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:04:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 261 transitions. [2018-02-02 20:04:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:04:20,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:20,201 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:20,201 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:20,201 INFO L82 PathProgramCache]: Analyzing trace with hash 873260497, now seen corresponding path program 1 times [2018-02-02 20:04:20,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:20,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:04:20,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:04:20,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:04:20,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:20,533 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 20:04:20,533 INFO L182 omatonBuilderFactory]: Interpolants [6689#true, 6690#false, 6691#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 6692#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 6693#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base)), 6694#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base) (= (select |#valid| list_add_~head.base) 1)), 6695#(and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|)), 6696#(and (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)), 6697#(and (= (select |#valid| |list_add_#in~head.base|) 1) (<= |list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 6698#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 6699#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| |gl_insert_#t~malloc14.base|))), 6700#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (not (= gl_insert_~node~0.base |~#gl_list.base|))), 6701#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 6702#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) 4) (<= 4 (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 6703#(and (<= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))) (<= 4 (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset))), 6704#(and (= |list_add_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (<= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) 4) (<= 4 (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= 12 (select |#length| |list_add_#t~mem7.base|))), 6705#(and (<= |__list_add_#in~next.offset| 4) (= 12 (select |#length| |__list_add_#in~next.base|)) (<= 4 |__list_add_#in~next.offset|)), 6706#(and (= (select |#length| __list_add_~next.base) 12) (<= __list_add_~next.offset 4) (<= 4 __list_add_~next.offset))] [2018-02-02 20:04:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:04:20,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:04:20,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:04:20,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:04:20,534 INFO L87 Difference]: Start difference. First operand 238 states and 261 transitions. Second operand 18 states. [2018-02-02 20:04:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:21,344 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-02-02 20:04:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:04:21,344 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 20:04:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:21,345 INFO L225 Difference]: With dead ends: 250 [2018-02-02 20:04:21,345 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:04:21,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:04:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:04:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 189. [2018-02-02 20:04:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 20:04:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2018-02-02 20:04:21,349 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 48 [2018-02-02 20:04:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:21,349 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2018-02-02 20:04:21,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:04:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2018-02-02 20:04:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:04:21,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:21,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:21,350 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:21,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970133, now seen corresponding path program 1 times [2018-02-02 20:04:21,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:21,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:21,392 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 20:04:21,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:21,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:04:21,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:21,393 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 20:04:21,393 INFO L182 omatonBuilderFactory]: Interpolants [7172#true, 7173#false, 7174#(= 1 (select |#valid| |gl_sort_~#dst~0.base|))] [2018-02-02 20:04:21,393 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 20:04:21,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:04:21,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:04:21,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:04:21,394 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 3 states. [2018-02-02 20:04:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:21,435 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2018-02-02 20:04:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:04:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 20:04:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:21,436 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:04:21,436 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:04:21,436 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 20:04:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:04:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-02-02 20:04:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-02 20:04:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2018-02-02 20:04:21,439 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 48 [2018-02-02 20:04:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:21,439 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2018-02-02 20:04:21,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:04:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2018-02-02 20:04:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:04:21,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:21,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:21,439 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:21,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970134, now seen corresponding path program 1 times [2018-02-02 20:04:21,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:21,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:21,473 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 20:04:21,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:21,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:04:21,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:21,473 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 20:04:21,473 INFO L182 omatonBuilderFactory]: Interpolants [7549#true, 7550#false, 7551#(and (= (select |#length| |gl_sort_~#dst~0.base|) 8) (= |gl_sort_~#dst~0.offset| 0))] [2018-02-02 20:04:21,473 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 20:04:21,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:04:21,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:04:21,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:04:21,474 INFO L87 Difference]: Start difference. First operand 187 states and 198 transitions. Second operand 3 states. [2018-02-02 20:04:21,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:21,512 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-02-02 20:04:21,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:04:21,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 20:04:21,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:21,513 INFO L225 Difference]: With dead ends: 185 [2018-02-02 20:04:21,514 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 20:04:21,514 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 20:04:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 20:04:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-02-02 20:04:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 20:04:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-02 20:04:21,516 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 48 [2018-02-02 20:04:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:21,516 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-02 20:04:21,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:04:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-02 20:04:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:04:21,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:21,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:21,517 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash 467934037, now seen corresponding path program 1 times [2018-02-02 20:04:21,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:21,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:21,594 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 20:04:21,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:21,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:04:21,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:21,594 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 20:04:21,594 INFO L182 omatonBuilderFactory]: Interpolants [7922#true, 7923#false, 7924#(= 1 (select |#valid| gl_insert_~node~0.base)), 7925#(and (= list_add_~head.base |list_add_#in~head.base|) (= list_add_~head.offset |list_add_#in~head.offset|) (= |list_add_#in~new.base| list_add_~new.base)), 7926#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 7927#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 7928#(= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 7929#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 7930#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7931#(= 1 (select |#valid| |gl_destroy_#t~mem18.base|)), 7932#(= 1 (select |#valid| gl_destroy_~next~0.base))] [2018-02-02 20:04:21,595 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 20:04:21,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:04:21,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:04:21,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:04:21,595 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 11 states. [2018-02-02 20:04:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:22,348 INFO L93 Difference]: Finished difference Result 265 states and 286 transitions. [2018-02-02 20:04:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:04:22,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-02 20:04:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:22,349 INFO L225 Difference]: With dead ends: 265 [2018-02-02 20:04:22,349 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 20:04:22,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:04:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 20:04:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 191. [2018-02-02 20:04:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:04:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 205 transitions. [2018-02-02 20:04:22,354 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 205 transitions. Word has length 55 [2018-02-02 20:04:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:22,354 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 205 transitions. [2018-02-02 20:04:22,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:04:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 205 transitions. [2018-02-02 20:04:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:04:22,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:22,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:22,355 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash 467934038, now seen corresponding path program 1 times [2018-02-02 20:04:22,356 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:22,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:22,541 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 20:04:22,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:22,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:04:22,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:22,542 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 20:04:22,542 INFO L182 omatonBuilderFactory]: Interpolants [8416#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 8417#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 8418#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= list_add_~head.base |list_add_#in~head.base|) (= list_add_~head.offset |list_add_#in~head.offset|) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base)), 8419#(and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|)), 8420#(and (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)), 8421#(and (<= |list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 8422#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 8423#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8424#(and (= 12 (select |#length| |gl_destroy_#t~mem18.base|)) (<= |gl_destroy_#t~mem18.offset| 4) (<= 4 |gl_destroy_#t~mem18.offset|)), 8425#(and (<= gl_destroy_~next~0.offset 4) (<= 4 gl_destroy_~next~0.offset) (= (select |#length| gl_destroy_~next~0.base) 12)), 8414#true, 8415#false] [2018-02-02 20:04:22,542 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 20:04:22,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:04:22,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:04:22,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:04:22,543 INFO L87 Difference]: Start difference. First operand 191 states and 205 transitions. Second operand 12 states. [2018-02-02 20:04:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:23,484 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2018-02-02 20:04:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:04:23,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-02 20:04:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:23,485 INFO L225 Difference]: With dead ends: 213 [2018-02-02 20:04:23,485 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:04:23,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:04:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:04:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2018-02-02 20:04:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:04:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2018-02-02 20:04:23,488 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 55 [2018-02-02 20:04:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:23,488 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2018-02-02 20:04:23,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:04:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2018-02-02 20:04:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:04:23,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:23,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:23,489 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1242217214, now seen corresponding path program 1 times [2018-02-02 20:04:23,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:23,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:23,613 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 20:04:23,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:23,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:04:23,613 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:23,613 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 20:04:23,614 INFO L182 omatonBuilderFactory]: Interpolants [8864#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 8865#(= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 8866#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 8867#(not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 8868#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 8869#(= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |gl_destroy_#t~mem18.base|), 8870#(= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) gl_destroy_~next~0.base), 8871#(= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)), 8856#true, 8857#false, 8858#(= (select |#valid| |~#gl_list.base|) 1), 8859#(= |#valid| |old(#valid)|), 8860#(= 0 (select |old(#valid)| |gl_insert_#t~malloc14.base|)), 8861#(= 0 (select |old(#valid)| gl_insert_~node~0.base)), 8862#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |list_add_#in~new.base| list_add_~new.base)), 8863#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|))] [2018-02-02 20:04:23,614 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 20:04:23,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:04:23,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:04:23,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:04:23,614 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand 16 states. [2018-02-02 20:04:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:24,586 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-02-02 20:04:24,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:04:24,586 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 20:04:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:24,587 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:04:24,587 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 20:04:24,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:04:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 20:04:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 192. [2018-02-02 20:04:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:04:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2018-02-02 20:04:24,592 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 58 [2018-02-02 20:04:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:24,592 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2018-02-02 20:04:24,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:04:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2018-02-02 20:04:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:04:24,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:24,593 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, 1, 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 20:04:24,593 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1552523800, now seen corresponding path program 1 times [2018-02-02 20:04:24,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:24,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:24,892 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 20:04:24,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:04:24,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:04:24,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:24,892 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 20:04:24,893 INFO L182 omatonBuilderFactory]: Interpolants [9344#false, 9345#(not (= 0 |gl_insert_#t~malloc14.base|)), 9346#(not (= 0 gl_insert_~node~0.base)), 9347#(and (= list_add_~head.base |list_add_#in~head.base|) (= list_add_~head.offset |list_add_#in~head.offset|) (= |list_add_#in~new.base| list_add_~new.base)), 9348#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 9349#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 9350#(= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 9351#(not (= 0 (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 9352#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9353#(and (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 9354#(and (= |list_empty_#t~mem0.offset| (select (select |#memory_$Pointer$.offset| list_empty_~head.base) list_empty_~head.offset)) (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 9355#(or (= |list_empty_#in~head.offset| (select (select |#memory_$Pointer$.offset| |list_empty_#in~head.base|) |list_empty_#in~head.offset|)) (= 0 |list_empty_#res|)), 9356#(or (and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |gl_sort_#t~ret28| 0)), 9357#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9358#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 9359#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| |gl_destroy_#t~mem18.offset|) (not (= 0 |gl_destroy_#t~mem18.base|))), 9360#(and (= (select |#valid| |~#gl_list.base|) 1) (not (= 0 gl_destroy_~next~0.base)) (= gl_destroy_~next~0.offset |~#gl_list.offset|)), 9361#(and (= (select |#valid| |~#gl_list.base|) 1) (not (= 0 gl_destroy_~next~0.base)) (= (select (store |#valid| gl_destroy_~next~0.base 0) |~#gl_list.base|) (select |#valid| |~#gl_list.base|))), 9362#(= 1 (select |#valid| |~#gl_list.base|)), 9343#true] [2018-02-02 20:04:24,893 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 20:04:24,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:04:24,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:04:24,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:04:24,893 INFO L87 Difference]: Start difference. First operand 192 states and 204 transitions. Second operand 20 states. [2018-02-02 20:04:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:25,939 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2018-02-02 20:04:25,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:04:25,940 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-02 20:04:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:25,941 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:04:25,941 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:04:25,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:04:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:04:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-02-02 20:04:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:04:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 206 transitions. [2018-02-02 20:04:25,945 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 206 transitions. Word has length 60 [2018-02-02 20:04:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:25,946 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 206 transitions. [2018-02-02 20:04:25,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:04:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 206 transitions. [2018-02-02 20:04:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:04:25,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:25,947 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:25,947 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash 11633541, now seen corresponding path program 1 times [2018-02-02 20:04:25,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:25,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:26,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:26,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:04:26,231 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:26,231 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 20:04:26,231 INFO L182 omatonBuilderFactory]: Interpolants [9824#(and (= list_add_~head.base |list_add_#in~head.base|) (= list_add_~head.offset |list_add_#in~head.offset|) (= |list_add_#in~new.base| list_add_~new.base)), 9825#(and (= list_add_~head.base |list_add_#in~head.base|) (= list_add_~head.offset |list_add_#in~head.offset|) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| list_add_~new.base)), 9826#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 9827#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 9828#(and (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 9829#(and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 9830#(= list_empty_~head.base |list_empty_#in~head.base|), 9831#(and (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|))), 9832#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (= (select |#valid| |gl_sort_~#dst~0.base|) 1)), 9833#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 9834#(= 1 (select |#valid| |gl_seek_max_#t~mem23.base|)), 9835#(= 1 (select |#valid| gl_seek_max_~max_pos~0.base)), 9836#(= 1 (select |#valid| |val_from_node_#in~head.base|)), 9837#(= 1 (select |#valid| val_from_node_~entry~0.base)), 9821#true, 9822#false, 9823#(= 1 (select |#valid| gl_insert_~node~0.base))] [2018-02-02 20:04:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:26,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:04:26,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:04:26,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:04:26,232 INFO L87 Difference]: Start difference. First operand 194 states and 206 transitions. Second operand 17 states. [2018-02-02 20:04:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:27,206 INFO L93 Difference]: Finished difference Result 285 states and 311 transitions. [2018-02-02 20:04:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:04:27,206 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-02 20:04:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:27,207 INFO L225 Difference]: With dead ends: 285 [2018-02-02 20:04:27,207 INFO L226 Difference]: Without dead ends: 285 [2018-02-02 20:04:27,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:04:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-02-02 20:04:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 230. [2018-02-02 20:04:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:04:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2018-02-02 20:04:27,211 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 65 [2018-02-02 20:04:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:27,212 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2018-02-02 20:04:27,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:04:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2018-02-02 20:04:27,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:04:27,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:27,213 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:27,213 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 11633542, now seen corresponding path program 1 times [2018-02-02 20:04:27,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:27,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:27,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:27,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 20:04:27,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:27,681 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 20:04:27,681 INFO L182 omatonBuilderFactory]: Interpolants [10380#true, 10381#false, 10382#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 10383#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 10384#(and (= gl_insert_~node~0.offset 0) (= 12 (select |#length| gl_insert_~node~0.base)) (= 1 (select |#valid| gl_insert_~node~0.base))), 10385#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset)), 10386#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~head.base| list_add_~head.base) (= 1 (select |#valid| list_add_~head.base)) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset)), 10387#(and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|)), 10388#(and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)), 10389#(and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (<= |list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|) (= 1 (select |#valid| |list_add_#in~head.base|))), 10390#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 10391#(= list_empty_~head.base |list_empty_#in~head.base|), 10392#(and (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (<= (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (<= 4 (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))), 10393#(and (<= (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|) 4) (<= 4 (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)))), 10394#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 10395#(or (not (= |gl_seek_max_#t~ret22| 0)) (and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 10396#(and (<= |gl_seek_max_#t~mem23.offset| 4) (<= 4 |gl_seek_max_#t~mem23.offset|) (= 12 (select |#length| |gl_seek_max_#t~mem23.base|))), 10397#(and (<= gl_seek_max_~max_pos~0.offset 4) (<= 4 gl_seek_max_~max_pos~0.offset) (= 12 (select |#length| gl_seek_max_~max_pos~0.base))), 10398#(and (<= |val_from_node_#in~head.offset| 4) (= 12 (select |#length| |val_from_node_#in~head.base|)) (<= 4 |val_from_node_#in~head.offset|)), 10399#(and (= (select |#length| val_from_node_~entry~0.base) 12) (<= 0 val_from_node_~entry~0.offset) (<= val_from_node_~entry~0.offset 0))] [2018-02-02 20:04:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:27,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:04:27,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:04:27,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:04:27,681 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand 20 states. [2018-02-02 20:04:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:28,723 INFO L93 Difference]: Finished difference Result 278 states and 302 transitions. [2018-02-02 20:04:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:04:28,723 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-02 20:04:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:28,724 INFO L225 Difference]: With dead ends: 278 [2018-02-02 20:04:28,724 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 20:04:28,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:04:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 20:04:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2018-02-02 20:04:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 20:04:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 249 transitions. [2018-02-02 20:04:28,727 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 249 transitions. Word has length 65 [2018-02-02 20:04:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:28,728 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 249 transitions. [2018-02-02 20:04:28,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:04:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 249 transitions. [2018-02-02 20:04:28,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:04:28,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:28,728 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:28,729 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:28,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1266188342, now seen corresponding path program 1 times [2018-02-02 20:04:28,729 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:28,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:28,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:28,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:04:28,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:28,954 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 20:04:28,954 INFO L182 omatonBuilderFactory]: Interpolants [10944#(= 0 |gl_insert_#t~malloc14.offset|), 10945#(= 0 gl_insert_~node~0.offset), 10946#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset)), 10947#(and (or (= __list_add_~new.offset 0) (and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|))) (or (not (= __list_add_~new.offset 0)) (<= |__list_add_#in~new.offset| __list_add_~new.offset))), 10948#(or (not (= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) 0)) (<= |__list_add_#in~new.offset| 0)), 10949#(or (not (= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0)) (<= |list_add_#in~new.offset| 0)), 10950#(not (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 0)), 10951#(not (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.offset|)), 10952#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10953#(and (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 10954#(and (= |list_empty_#t~mem0.offset| (select (select |#memory_$Pointer$.offset| list_empty_~head.base) list_empty_~head.offset)) (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 10955#(or (= |list_empty_#in~head.offset| (select (select |#memory_$Pointer$.offset| |list_empty_#in~head.base|) |list_empty_#in~head.offset|)) (= 0 |list_empty_#res|)), 10956#(or (= |~#gl_list.offset| (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|)) (= |gl_sort_#t~ret28| 0)), 10957#(= |~#gl_list.offset| (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|)), 10941#true, 10942#false, 10943#(= 0 |~#gl_list.offset|)] [2018-02-02 20:04:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:28,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:04:28,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:04:28,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:04:28,955 INFO L87 Difference]: Start difference. First operand 230 states and 249 transitions. Second operand 17 states. [2018-02-02 20:04:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:29,768 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2018-02-02 20:04:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:04:29,768 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-02 20:04:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:29,769 INFO L225 Difference]: With dead ends: 233 [2018-02-02 20:04:29,769 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 20:04:29,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:04:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 20:04:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 210. [2018-02-02 20:04:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:04:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-02 20:04:29,775 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 63 [2018-02-02 20:04:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:29,775 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-02 20:04:29,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:04:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-02 20:04:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:04:29,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:29,776 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:29,776 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238810, now seen corresponding path program 1 times [2018-02-02 20:04:29,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:29,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:29,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:29,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:04:29,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:29,827 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 20:04:29,827 INFO L182 omatonBuilderFactory]: Interpolants [11450#true, 11451#false, 11452#(= (select |#valid| |gl_sort_~#dst~0.base|) 1), 11453#(= 1 (select |#valid| |list_add_#in~head.base|)), 11454#(= 1 (select |#valid| list_add_~head.base))] [2018-02-02 20:04:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:29,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:04:29,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:04:29,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:04:29,828 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 5 states. [2018-02-02 20:04:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:30,124 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 20:04:30,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:04:30,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 20:04:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:30,125 INFO L225 Difference]: With dead ends: 217 [2018-02-02 20:04:30,126 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 20:04:30,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 20:04:30,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 20:04:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-02-02 20:04:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 20:04:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-02-02 20:04:30,129 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 67 [2018-02-02 20:04:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:30,130 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-02-02 20:04:30,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:04:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-02-02 20:04:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:04:30,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:30,130 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:30,130 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238809, now seen corresponding path program 1 times [2018-02-02 20:04:30,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:30,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:30,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:30,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:04:30,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:30,209 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 20:04:30,209 INFO L182 omatonBuilderFactory]: Interpolants [11891#true, 11892#false, 11893#(and (= 0 |gl_sort_~#dst~0.offset|) (= 8 (select |#length| |gl_sort_~#dst~0.base|))), 11894#(and (= 0 |list_add_#in~head.offset|) (= 8 (select |#length| |list_add_#in~head.base|))), 11895#(and (= (select |#length| list_add_~head.base) 8) (= list_add_~head.offset 0))] [2018-02-02 20:04:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:30,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:04:30,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:04:30,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:04:30,210 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-02-02 20:04:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:30,452 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-02 20:04:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:04:30,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 20:04:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:30,453 INFO L225 Difference]: With dead ends: 216 [2018-02-02 20:04:30,453 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 20:04:30,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 20:04:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 20:04:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 20:04:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 20:04:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-02 20:04:30,456 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 67 [2018-02-02 20:04:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:30,456 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-02 20:04:30,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:04:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-02 20:04:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:04:30,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:30,456 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:04:30,456 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1238184798, now seen corresponding path program 1 times [2018-02-02 20:04:30,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:30,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:30,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:30,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:04:30,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:30,520 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 20:04:30,520 INFO L182 omatonBuilderFactory]: Interpolants [12330#true, 12331#false, 12332#(and (= 0 |gl_seek_max_#res.base|) (= 0 |gl_seek_max_#res.offset|)), 12333#(and (= 0 |gl_sort_#t~ret29.offset|) (= 0 |gl_sort_#t~ret29.base|)), 12334#(and (= 0 gl_sort_~max_pos~1.offset) (= 0 gl_sort_~max_pos~1.base))] [2018-02-02 20:04:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:30,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:04:30,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:04:30,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:04:30,521 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 5 states. [2018-02-02 20:04:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:30,536 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2018-02-02 20:04:30,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:04:30,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 20:04:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:30,538 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:04:30,538 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:04:30,538 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 20:04:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:04:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-02 20:04:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 20:04:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-02 20:04:30,541 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 67 [2018-02-02 20:04:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:30,542 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-02 20:04:30,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:04:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-02 20:04:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:04:30,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:30,543 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:30,543 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:30,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923251, now seen corresponding path program 1 times [2018-02-02 20:04:30,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:30,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:30,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:30,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:04:30,652 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:30,652 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 20:04:30,652 INFO L182 omatonBuilderFactory]: Interpolants [12784#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))), 12785#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 12786#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))), 12787#(= 1 (select |#valid| |list_add_#t~mem7.base|)), 12788#(= 1 (select |#valid| |__list_add_#in~next.base|)), 12789#(= 1 (select |#valid| __list_add_~next.base)), 12781#true, 12782#false, 12783#(and (= |gl_sort_~#dst~0.base| (select (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= (select |#valid| |gl_sort_~#dst~0.base|) 1))] [2018-02-02 20:04:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:30,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:04:30,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:04:30,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:04:30,653 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-02-02 20:04:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:31,048 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-02-02 20:04:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:04:31,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 20:04:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:31,049 INFO L225 Difference]: With dead ends: 244 [2018-02-02 20:04:31,049 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 20:04:31,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:04:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 20:04:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2018-02-02 20:04:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 20:04:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-02-02 20:04:31,053 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 70 [2018-02-02 20:04:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:31,053 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-02-02 20:04:31,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:04:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-02-02 20:04:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:04:31,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:31,054 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:31,054 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:31,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923252, now seen corresponding path program 1 times [2018-02-02 20:04:31,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:31,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:31,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:31,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:04:31,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:31,318 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 20:04:31,318 INFO L182 omatonBuilderFactory]: Interpolants [13280#(and (= 0 |gl_sort_~#dst~0.offset|) (= 8 (select |#length| |gl_sort_~#dst~0.base|))), 13281#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))) (= 0 (select (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|) |gl_sort_~#dst~0.offset|))), 13282#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 13283#(and (= 0 (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)))), 13284#(and (= 8 (select |#length| |list_add_#t~mem7.base|)) (= 0 |list_add_#t~mem7.offset|)), 13285#(and (= 8 (select |#length| |__list_add_#in~next.base|)) (= 0 |__list_add_#in~next.offset|)), 13286#(and (= __list_add_~next.offset 0) (= (select |#length| __list_add_~next.base) 8)), 13278#true, 13279#false] [2018-02-02 20:04:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:31,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:04:31,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:04:31,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:04:31,321 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 9 states. [2018-02-02 20:04:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:31,616 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-02-02 20:04:31,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:04:31,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 20:04:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:31,617 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:04:31,617 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:04:31,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:04:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:04:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2018-02-02 20:04:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 20:04:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2018-02-02 20:04:31,622 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 70 [2018-02-02 20:04:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:31,622 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2018-02-02 20:04:31,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:04:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2018-02-02 20:04:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:04:31,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:31,623 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:31,623 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:31,623 INFO L82 PathProgramCache]: Analyzing trace with hash -200117613, now seen corresponding path program 1 times [2018-02-02 20:04:31,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:31,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:31,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:31,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:04:31,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:31,729 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 20:04:31,729 INFO L182 omatonBuilderFactory]: Interpolants [13776#true, 13777#false, 13778#(= list_empty_~head.base |list_empty_#in~head.base|), 13779#(and (= 1 (select |#valid| list_empty_~head.base)) (= list_empty_~head.base |list_empty_#in~head.base|)), 13780#(= 1 (select |#valid| |list_empty_#in~head.base|)), 13781#(= 1 (select |#valid| |~#gl_list.base|)), 13782#(= 1 (select |#valid| |list_add_#in~new.base|)), 13783#(= 1 (select |#valid| list_add_~new.base)), 13784#(= 1 (select |#valid| |__list_add_#in~new.base|)), 13785#(= 1 (select |#valid| __list_add_~new.base))] [2018-02-02 20:04:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:31,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:04:31,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:04:31,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:04:31,730 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand 10 states. [2018-02-02 20:04:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:32,193 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-02-02 20:04:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:04:32,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-02 20:04:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:32,194 INFO L225 Difference]: With dead ends: 249 [2018-02-02 20:04:32,194 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 20:04:32,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:04:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 20:04:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2018-02-02 20:04:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:04:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-02-02 20:04:32,199 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 71 [2018-02-02 20:04:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:32,199 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-02-02 20:04:32,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:04:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-02-02 20:04:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:04:32,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:32,200 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:32,200 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:32,201 INFO L82 PathProgramCache]: Analyzing trace with hash -200117612, now seen corresponding path program 1 times [2018-02-02 20:04:32,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:32,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:32,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:32,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:04:32,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:32,402 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 20:04:32,402 INFO L182 omatonBuilderFactory]: Interpolants [14304#(and (<= 4 (select |#length| list_add_~new.base)) (= 0 list_add_~new.offset)), 14305#(and (<= 4 (select |#length| |__list_add_#in~new.base|)) (= 0 |__list_add_#in~new.offset|)), 14306#(and (= __list_add_~new.offset 0) (<= 4 (select |#length| __list_add_~new.base))), 14295#true, 14296#false, 14297#(= 0 |~#gl_list.offset|), 14298#(and (or (= list_empty_~head.offset 0) (= |list_empty_#in~head.offset| list_empty_~head.offset)) (= list_empty_~head.base |list_empty_#in~head.base|)), 14299#(and (or (<= (+ list_empty_~head.offset 4) (select |#length| list_empty_~head.base)) (not (= list_empty_~head.offset 0))) (or (= list_empty_~head.offset 0) (= |list_empty_#in~head.offset| list_empty_~head.offset)) (= list_empty_~head.base |list_empty_#in~head.base|)), 14300#(or (<= 4 (select |#length| |list_empty_#in~head.base|)) (not (= |list_empty_#in~head.offset| 0))), 14301#(or (<= 4 (select |#length| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0))), 14302#(and (= 0 |~#gl_list.offset|) (<= 4 (select |#length| |~#gl_list.base|))), 14303#(and (= 0 |list_add_#in~new.offset|) (<= 4 (select |#length| |list_add_#in~new.base|)))] [2018-02-02 20:04:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:32,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:04:32,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:04:32,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:04:32,403 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 12 states. [2018-02-02 20:04:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:32,874 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-02-02 20:04:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:04:32,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-02-02 20:04:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:32,875 INFO L225 Difference]: With dead ends: 248 [2018-02-02 20:04:32,875 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 20:04:32,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:04:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 20:04:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-02-02 20:04:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:04:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2018-02-02 20:04:32,880 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 71 [2018-02-02 20:04:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:32,880 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2018-02-02 20:04:32,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:04:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2018-02-02 20:04:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:04:32,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:32,881 INFO L351 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:32,881 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1908678729, now seen corresponding path program 1 times [2018-02-02 20:04:32,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:32,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:33,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:33,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 20:04:33,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:33,201 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 20:04:33,201 INFO L182 omatonBuilderFactory]: Interpolants [14816#(= 0 (select |old(#valid)| |gl_insert_#t~malloc14.base|)), 14817#(= 0 (select |old(#valid)| gl_insert_~node~0.base)), 14818#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |list_add_#in~new.base| list_add_~new.base)), 14819#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| list_add_~new.base)), 14820#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 14821#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 14822#(and (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 14823#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 14824#(and (= (select |#valid| |~#gl_list.base|) 1) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 14825#(= list_empty_~head.base |list_empty_#in~head.base|), 14826#(and (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)))), 14827#(not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))), 14828#(not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 14829#(and (= list_empty_~head.offset |list_empty_#in~head.offset|) (= list_empty_~head.base |list_empty_#in~head.base|)), 14830#(and (= (select (select |#memory_$Pointer$.base| list_empty_~head.base) |list_empty_#in~head.offset|) |list_empty_#t~mem0.base|) (= list_empty_~head.base |list_empty_#in~head.base|)), 14831#(or (and (= (select (select |#memory_$Pointer$.base| |list_empty_#in~head.base|) |list_empty_#in~head.offset|) |list_empty_#in~head.base|) (= 1 |list_empty_#res|)) (= 0 |list_empty_#res|)), 14832#(or (= |gl_seek_max_#t~ret22| 0) (and (= 1 |gl_seek_max_#t~ret22|) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 14833#(= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)), 14812#true, 14813#false, 14814#(= (select |#valid| |~#gl_list.base|) 1), 14815#(= |#valid| |old(#valid)|)] [2018-02-02 20:04:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:33,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:04:33,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:04:33,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:04:33,202 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand 22 states. [2018-02-02 20:04:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:34,901 INFO L93 Difference]: Finished difference Result 294 states and 320 transitions. [2018-02-02 20:04:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:04:34,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-02-02 20:04:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:34,902 INFO L225 Difference]: With dead ends: 294 [2018-02-02 20:04:34,902 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 20:04:34,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=2445, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:04:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 20:04:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2018-02-02 20:04:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 20:04:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 261 transitions. [2018-02-02 20:04:34,906 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 261 transitions. Word has length 72 [2018-02-02 20:04:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:34,906 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 261 transitions. [2018-02-02 20:04:34,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:04:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 261 transitions. [2018-02-02 20:04:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:04:34,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:34,906 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:34,906 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 334330969, now seen corresponding path program 1 times [2018-02-02 20:04:34,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:34,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:35,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:35,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 20:04:35,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:35,528 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 20:04:35,529 INFO L182 omatonBuilderFactory]: Interpolants [15433#true, 15434#false, 15435#(= (select |#valid| |~#gl_list.base|) 1), 15436#(= |#valid| |old(#valid)|), 15437#(= 0 (select |old(#valid)| |gl_insert_#t~malloc14.base|)), 15438#(= 0 (select |old(#valid)| gl_insert_~node~0.base)), 15439#(and (= 0 (select |old(#valid)| gl_insert_~node~0.base)) (= (select |#valid| gl_insert_~node~0.base) 1)), 15440#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |list_add_#in~new.base| list_add_~new.base)), 15441#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| list_add_~new.base)), 15442#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 15443#(and (= 1 (select |#valid| __list_add_~next.base)) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 15444#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 15445#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| __list_add_~prev.base (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base)) __list_add_~new.base) __list_add_~new.offset)))) (= __list_add_~new.base __list_add_~prev.base)) (= __list_add_~new.base |__list_add_#in~new.base|)), 15446#(or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))))), 15447#(and (= (select |#valid| |list_add_#in~head.base|) 1) (or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|)))), 15448#(and (= (select |#valid| |~#gl_list.base|) 1) (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))))), 15449#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 1) (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))), 15450#(= list_empty_~head.base |list_empty_#in~head.base|), 15451#(and (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (or (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))) (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|))), 15452#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))), 15453#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))), 15454#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|))), 15455#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 15456#(= 1 (select |#valid| |gl_seek_max_#t~mem25.base|)), 15457#(= 1 (select |#valid| gl_seek_max_~pos~0.base)), 15458#(= 1 (select |#valid| |val_from_node_#in~head.base|)), 15459#(= 1 (select |#valid| val_from_node_~entry~0.base))] [2018-02-02 20:04:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:35,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:04:35,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:04:35,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:04:35,529 INFO L87 Difference]: Start difference. First operand 240 states and 261 transitions. Second operand 27 states. [2018-02-02 20:04:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:37,277 INFO L93 Difference]: Finished difference Result 300 states and 326 transitions. [2018-02-02 20:04:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:04:37,277 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-02-02 20:04:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:37,278 INFO L225 Difference]: With dead ends: 300 [2018-02-02 20:04:37,278 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 20:04:37,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=2751, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:04:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 20:04:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2018-02-02 20:04:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 20:04:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 276 transitions. [2018-02-02 20:04:37,281 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 276 transitions. Word has length 76 [2018-02-02 20:04:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:37,281 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 276 transitions. [2018-02-02 20:04:37,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:04:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 276 transitions. [2018-02-02 20:04:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:04:37,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:37,282 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:37,282 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 334330970, now seen corresponding path program 1 times [2018-02-02 20:04:37,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:37,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:38,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:38,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-02 20:04:38,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:38,104 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 20:04:38,105 INFO L182 omatonBuilderFactory]: Interpolants [16074#true, 16075#false, 16076#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.offset| (select (store (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.offset|) |~#gl_list.offset|)) (= |~#gl_list.base| (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|))), 16077#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16078#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| |gl_insert_#t~malloc14.base|) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16079#(and (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16080#(and (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~0.base (select |#memory_$Pointer$.offset| gl_insert_~node~0.base)) |#memory_$Pointer$.offset|) (= 1 (select |#valid| gl_insert_~node~0.base)) (= (store |old(#memory_$Pointer$.base)| gl_insert_~node~0.base (select |#memory_$Pointer$.base| gl_insert_~node~0.base)) |#memory_$Pointer$.base|)), 16081#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16082#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base)), 16083#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem7.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= 1 (select |#valid| list_add_~head.base)) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#t~mem7.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~new.base| list_add_~new.base)), 16084#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16085#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (= __list_add_~new.base |__list_add_#in~new.base|) (or (and (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|) (= |__list_add_#in~next.offset| __list_add_~next.offset)) (= __list_add_~new.base __list_add_~prev.base))), 16086#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (= __list_add_~new.base |__list_add_#in~new.base|) (or (and (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (= |__list_add_#in~next.offset| __list_add_~next.offset)) (= __list_add_~new.base __list_add_~prev.base))), 16087#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (and (= (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset) |__list_add_#in~next.base|) (or (= (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset) __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (= |__list_add_#in~next.offset| (select (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset) __list_add_~new.offset))) (= __list_add_~new.base __list_add_~prev.base)) (= __list_add_~new.base |__list_add_#in~new.base|)), 16088#(or (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) |__list_add_#in~next.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) |__list_add_#in~prev.base|)) (= |__list_add_#in~next.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|)), 16089#(and (or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) |list_add_#in~head.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))))) (= 1 (select |#valid| |list_add_#in~head.base|))), 16090#(and (or (= (select |old(#valid)| |~#gl_list.base|) 0) (and (or (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))) (= 1 (select |#valid| |~#gl_list.base|))), 16091#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))), 16092#(= list_empty_~head.base |list_empty_#in~head.base|), 16093#(or (not (= |gl_sort_#t~ret28| 0)) (and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (not (= 0 (select |#valid| |~#gl_list.base|))) (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))))), 16094#(and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (not (= 0 (select |#valid| |~#gl_list.base|))) (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 16095#(and (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (= |~#gl_list.offset| (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))) (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))), 16096#(and (= |~#gl_list.offset| (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))) (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))), 16097#(and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))), 16098#(and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|)) (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|))), 16099#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 16100#(and (= |~#gl_list.offset| |gl_seek_max_#t~mem25.offset|) (= |~#gl_list.base| |gl_seek_max_#t~mem25.base|)), 16101#(and (= gl_seek_max_~pos~0.offset |~#gl_list.offset|) (= |~#gl_list.base| gl_seek_max_~pos~0.base))] [2018-02-02 20:04:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:38,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:04:38,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:04:38,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:04:38,107 INFO L87 Difference]: Start difference. First operand 251 states and 276 transitions. Second operand 28 states. [2018-02-02 20:04:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:40,543 INFO L93 Difference]: Finished difference Result 342 states and 378 transitions. [2018-02-02 20:04:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:04:40,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-02-02 20:04:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:40,544 INFO L225 Difference]: With dead ends: 342 [2018-02-02 20:04:40,544 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 20:04:40,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=322, Invalid=2434, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:04:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 20:04:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 297. [2018-02-02 20:04:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 20:04:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-02-02 20:04:40,547 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 76 [2018-02-02 20:04:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:40,547 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-02-02 20:04:40,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:04:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-02-02 20:04:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:04:40,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:40,548 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:40,548 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:40,548 INFO L82 PathProgramCache]: Analyzing trace with hash -415915384, now seen corresponding path program 1 times [2018-02-02 20:04:40,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:40,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:40,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:40,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:04:40,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:40,590 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 20:04:40,590 INFO L182 omatonBuilderFactory]: Interpolants [16800#(= 1 (select |#valid| |list_move_#in~list.base|)), 16801#(= 1 (select |#valid| list_move_~list.base)), 16794#true, 16795#false, 16796#(= 1 (select |#valid| gl_seek_max_~max_pos~0.base)), 16797#(= 1 (select |#valid| |gl_seek_max_#res.base|)), 16798#(= 1 (select |#valid| |gl_sort_#t~ret29.base|)), 16799#(= 1 (select |#valid| gl_sort_~max_pos~1.base))] [2018-02-02 20:04:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:40,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:04:40,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:04:40,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:04:40,590 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 8 states. [2018-02-02 20:04:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:40,901 INFO L93 Difference]: Finished difference Result 343 states and 390 transitions. [2018-02-02 20:04:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:04:40,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-02-02 20:04:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:40,903 INFO L225 Difference]: With dead ends: 343 [2018-02-02 20:04:40,903 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 20:04:40,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:04:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 20:04:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-02-02 20:04:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 20:04:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 375 transitions. [2018-02-02 20:04:40,908 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 375 transitions. Word has length 81 [2018-02-02 20:04:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:40,909 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 375 transitions. [2018-02-02 20:04:40,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:04:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-02-02 20:04:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:04:40,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:40,910 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:40,910 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:40,910 INFO L82 PathProgramCache]: Analyzing trace with hash -415915383, now seen corresponding path program 1 times [2018-02-02 20:04:40,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:40,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:41,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:41,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 20:04:41,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:41,445 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 20:04:41,445 INFO L182 omatonBuilderFactory]: Interpolants [17481#true, 17482#false, 17483#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 17484#(and (= (select |#length| gl_insert_~node~0.base) 12) (= 0 gl_insert_~node~0.offset)), 17485#(and (= gl_insert_~node~0.offset 0) (= (select |#valid| gl_insert_~node~0.base) 1) (= (select |#length| gl_insert_~node~0.base) 12)), 17486#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset)), 17487#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#valid| |list_add_#in~head.base|) 1)), 17488#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|)), 17489#(and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)), 17490#(and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (select |#valid| |list_add_#in~head.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|)), 17491#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 1) (= (select |#valid| |~#gl_list.base|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 17492#(= list_empty_~head.base |list_empty_#in~head.base|), 17493#(and (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (<= (+ (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)))), 17494#(<= (+ (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|) 8) (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))), 17495#(<= (+ (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 17496#(and (= |gl_seek_max_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= |gl_seek_max_#t~mem23.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 17497#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 17498#(and (<= (+ val_from_node_~entry~0.offset 4) |val_from_node_#in~head.offset|) (= val_from_node_~entry~0.base |val_from_node_#in~head.base|)), 17499#(<= 4 |val_from_node_#in~head.offset|), 17500#(and (<= 4 gl_seek_max_~max_pos~0.offset) (<= (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| gl_seek_max_~max_pos~0.base)) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 17501#(and (<= (+ |gl_seek_max_#res.offset| (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (+ (select |#length| |gl_seek_max_#res.base|) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (<= 4 |gl_seek_max_#res.offset|)), 17502#(and (<= (+ |gl_sort_#t~ret29.offset| 8) (select |#length| |gl_sort_#t~ret29.base|)) (<= 4 |gl_sort_#t~ret29.offset|)), 17503#(and (<= (+ gl_sort_~max_pos~1.offset 8) (select |#length| gl_sort_~max_pos~1.base)) (<= 4 gl_sort_~max_pos~1.offset)), 17504#(and (<= 4 |list_move_#in~list.offset|) (<= (+ |list_move_#in~list.offset| 8) (select |#length| |list_move_#in~list.base|))), 17505#(and (<= (+ list_move_~list.offset 8) (select |#length| list_move_~list.base)) (<= 4 list_move_~list.offset))] [2018-02-02 20:04:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:41,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:04:41,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:04:41,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:04:41,446 INFO L87 Difference]: Start difference. First operand 330 states and 375 transitions. Second operand 25 states. [2018-02-02 20:04:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:42,983 INFO L93 Difference]: Finished difference Result 369 states and 412 transitions. [2018-02-02 20:04:42,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:04:42,984 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-02-02 20:04:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:42,984 INFO L225 Difference]: With dead ends: 369 [2018-02-02 20:04:42,985 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 20:04:42,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:04:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 20:04:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 339. [2018-02-02 20:04:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 20:04:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 385 transitions. [2018-02-02 20:04:42,988 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 385 transitions. Word has length 81 [2018-02-02 20:04:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:42,988 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 385 transitions. [2018-02-02 20:04:42,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:04:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 385 transitions. [2018-02-02 20:04:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:04:42,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:42,989 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:42,989 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 924539713, now seen corresponding path program 1 times [2018-02-02 20:04:42,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:43,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:43,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:43,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:04:43,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:43,130 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 20:04:43,130 INFO L182 omatonBuilderFactory]: Interpolants [18272#false, 18273#(= 1 (select |#valid| |~#gl_list.base|)), 18274#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |gl_seek_max_#t~mem25.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 18275#(and (= 1 (select |#valid| |~#gl_list.base|)) (= gl_seek_max_~pos~0.base (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 18276#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 18277#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|))), 18278#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|))), 18279#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset))), 18280#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) |list_move_#in~list.offset|))), 18281#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset))), 18282#(= 1 (select |#valid| |list_move_#t~mem13.base|)), 18283#(= 1 (select |#valid| |__list_del_#in~next.base|)), 18284#(= 1 (select |#valid| __list_del_~next.base)), 18271#true] [2018-02-02 20:04:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:43,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:04:43,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:04:43,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:04:43,131 INFO L87 Difference]: Start difference. First operand 339 states and 385 transitions. Second operand 14 states. [2018-02-02 20:04:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:43,719 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-02 20:04:43,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:04:43,719 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-02 20:04:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:43,721 INFO L225 Difference]: With dead ends: 382 [2018-02-02 20:04:43,721 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 20:04:43,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:04:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 20:04:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 366. [2018-02-02 20:04:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 20:04:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 422 transitions. [2018-02-02 20:04:43,725 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 422 transitions. Word has length 85 [2018-02-02 20:04:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:43,725 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 422 transitions. [2018-02-02 20:04:43,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:04:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 422 transitions. [2018-02-02 20:04:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:04:43,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:43,726 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:43,726 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash 924539714, now seen corresponding path program 1 times [2018-02-02 20:04:43,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:43,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:44,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:44,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 20:04:44,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:44,089 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 20:04:44,089 INFO L182 omatonBuilderFactory]: Interpolants [19072#(and (<= (select |#length| |~#gl_list.base|) (select |#length| (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|))) (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|))), 19073#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|))), 19074#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset))) (= 0 (select (select |#memory_$Pointer$.offset| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset))), 19075#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) |list_move_#in~list.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |list_move_#in~list.base|) |list_move_#in~list.offset|))), 19076#(and (= 0 (select (select |#memory_$Pointer$.offset| list_move_~list.base) list_move_~list.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset)))), 19077#(and (<= 8 (select |#length| |list_move_#t~mem13.base|)) (= 0 |list_move_#t~mem13.offset|)), 19078#(and (<= 8 (select |#length| |__list_del_#in~next.base|)) (= 0 |__list_del_#in~next.offset|)), 19079#(and (= __list_del_~next.offset 0) (<= 8 (select |#length| __list_del_~next.base))), 19057#true, 19058#false, 19059#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 19060#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 19061#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 19062#(and (= 0 (select |old(#valid)| |gl_insert_#t~malloc14.base|)) (= |#length| (store |old(#length)| |gl_insert_#t~malloc14.base| (select |#length| |gl_insert_#t~malloc14.base|)))), 19063#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 19064#(= |list_add_#in~head.base| list_add_~head.base), 19065#(= __list_add_~prev.base |__list_add_#in~prev.base|), 19066#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (= (select |old(#length)| |~#gl_list.base|) (select |#length| |~#gl_list.base|))), 19067#(= list_empty_~head.base |list_empty_#in~head.base|), 19068#(and (<= 8 (select |#length| |~#gl_list.base|)) (= 0 |~#gl_list.offset|)), 19069#(and (= |gl_seek_max_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= |gl_seek_max_#t~mem25.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 19070#(and (= gl_seek_max_~pos~0.base (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= gl_seek_max_~pos~0.offset (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 19071#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (<= (select |#length| |~#gl_list.base|) (select |#length| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))))] [2018-02-02 20:04:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:44,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:04:44,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:04:44,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:04:44,090 INFO L87 Difference]: Start difference. First operand 366 states and 422 transitions. Second operand 23 states. [2018-02-02 20:04:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:45,493 INFO L93 Difference]: Finished difference Result 397 states and 453 transitions. [2018-02-02 20:04:45,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:04:45,493 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-02 20:04:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:45,494 INFO L225 Difference]: With dead ends: 397 [2018-02-02 20:04:45,494 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 20:04:45,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:04:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 20:04:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 366. [2018-02-02 20:04:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 20:04:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 421 transitions. [2018-02-02 20:04:45,498 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 421 transitions. Word has length 85 [2018-02-02 20:04:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:45,499 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 421 transitions. [2018-02-02 20:04:45,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:04:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 421 transitions. [2018-02-02 20:04:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:04:45,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:45,499 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:45,499 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:45,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039901, now seen corresponding path program 1 times [2018-02-02 20:04:45,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:45,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:04:46,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:04:46,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 20:04:46,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:46,578 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 20:04:46,579 INFO L182 omatonBuilderFactory]: Interpolants [19904#(or (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (or (<= 5 |__list_add_#in~new.offset|) (<= |__list_add_#in~new.offset| 3) (and (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) 8)) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)))) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|)), 19905#(and (or (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (or (<= 5 |list_add_#in~new.offset|) (and (= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) 8)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|)) (<= |list_add_#in~new.offset| 3))) (= |list_add_#in~new.base| |list_add_#in~head.base|)) (= (select |#valid| |list_add_#in~head.base|) 1)), 19906#(and (= (select |#valid| |~#gl_list.base|) 1) (or (and (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (= (select |old(#valid)| |~#gl_list.base|) 0))), 19907#(and (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 19908#(= list_empty_~head.base |list_empty_#in~head.base|), 19909#(or (and (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= |gl_sort_#t~ret28| 0))), 19910#(and (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 19911#(and (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (<= (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) 8))), 19912#(and (<= (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) 8))), 19913#(and (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8))), 19914#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |gl_seek_max_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= |gl_seek_max_#t~mem23.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 19915#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 19916#(<= (+ val_from_node_~entry~0.offset 4) |val_from_node_#in~head.offset|), 19917#(<= 4 |val_from_node_#in~head.offset|), 19918#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (<= 4 gl_seek_max_~max_pos~0.offset) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 19919#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (<= 4 gl_seek_max_~max_pos~0.offset) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) |gl_seek_max_#t~mem25.base|) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 19920#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) gl_seek_max_~pos~0.base) (<= 4 gl_seek_max_~max_pos~0.offset) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 19921#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (<= 4 gl_seek_max_~max_pos~0.offset) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= gl_seek_max_~max_pos~0.offset (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))), 19922#(and (= 1 (select |#valid| |~#gl_list.base|)) (<= |gl_seek_max_#res.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= |gl_seek_max_#res.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|) |~#gl_list.base|) (<= 4 |gl_seek_max_#res.offset|)), 19923#(and (<= |gl_sort_#t~ret29.offset| 4) (<= 4 |gl_sort_#t~ret29.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) 8)))), 19924#(and (<= gl_sort_~max_pos~1.offset 4) (<= 4 gl_sort_~max_pos~1.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) 8)))), 19925#(and (<= 4 |list_move_#in~list.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) 8))) (<= |list_move_#in~list.offset| 4)), 19926#(and (= 4 list_move_~list.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_move_~list.base) (+ list_move_~list.offset 4))))), 19927#(and (= 4 list_move_~list.offset) (= 1 (select |#valid| |list_move_#t~mem12.base|))), 19928#(= 1 (select |#valid| |list_move_#t~mem12.base|)), 19929#(= 1 (select |#valid| |__list_del_#in~prev.base|)), 19930#(= 1 (select |#valid| __list_del_~prev.base)), 19893#true, 19894#false, 19895#(= 1 (select |#valid| |~#gl_list.base|)), 19896#(= |#valid| |old(#valid)|), 19897#(and (= 0 |gl_insert_#t~malloc14.offset|) (= (select |old(#valid)| |gl_insert_#t~malloc14.base|) 0)), 19898#(and (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= 0 gl_insert_~node~0.offset)), 19899#(and (= gl_insert_~node~0.offset 0) (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= 1 (select |#valid| gl_insert_~node~0.base))), 19900#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base)), 19901#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#in~new.base| list_add_~new.base)), 19902#(and (or (<= __list_add_~new.offset 4) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (or (not (= 4 __list_add_~new.offset)) (and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (= __list_add_~new.base __list_add_~prev.base) (and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|))) (or (<= |__list_add_#in~new.offset| __list_add_~new.offset) (< 3 __list_add_~new.offset)) (= __list_add_~new.base |__list_add_#in~new.base|)), 19903#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (and (or (<= __list_add_~new.offset 4) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (or (<= |__list_add_#in~new.offset| __list_add_~new.offset) (< 3 __list_add_~new.offset)) (or (and (= |__list_add_#in~prev.base| (select (select (store |#memory_$Pointer$.base| __list_add_~prev.base (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base)) __list_add_~new.base) (+ __list_add_~new.offset 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= 4 __list_add_~new.offset))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (= __list_add_~new.base __list_add_~prev.base)) (= __list_add_~new.base |__list_add_#in~new.base|))] [2018-02-02 20:04:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:04:46,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 20:04:46,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 20:04:46,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:04:46,579 INFO L87 Difference]: Start difference. First operand 366 states and 421 transitions. Second operand 38 states. [2018-02-02 20:04:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:50,095 INFO L93 Difference]: Finished difference Result 422 states and 473 transitions. [2018-02-02 20:04:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:04:50,095 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-02-02 20:04:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:50,097 INFO L225 Difference]: With dead ends: 422 [2018-02-02 20:04:50,097 INFO L226 Difference]: Without dead ends: 422 [2018-02-02 20:04:50,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=653, Invalid=6829, Unknown=0, NotChecked=0, Total=7482 [2018-02-02 20:04:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-02 20:04:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 371. [2018-02-02 20:04:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-02 20:04:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 426 transitions. [2018-02-02 20:04:50,106 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 426 transitions. Word has length 86 [2018-02-02 20:04:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:50,106 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 426 transitions. [2018-02-02 20:04:50,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 20:04:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 426 transitions. [2018-02-02 20:04:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:04:50,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:50,107 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:50,107 INFO L371 AbstractCegarLoop]: === Iteration 41 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:50,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039900, now seen corresponding path program 1 times [2018-02-02 20:04:50,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:50,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:51,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:04:51,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2018-02-02 20:04:51,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:51,649 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 20:04:51,649 INFO L182 omatonBuilderFactory]: Interpolants [20824#true, 20825#false, 20826#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 20827#(and (= 1 (select |#valid| |~#gl_list.base|)) (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 20828#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 20829#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|) (= |#length| (store |old(#length)| |gl_insert_#t~malloc14.base| (select |#length| |gl_insert_#t~malloc14.base|))) (= (select |old(#valid)| |gl_insert_#t~malloc14.base|) 0)), 20830#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 12 (select |#length| gl_insert_~node~0.base)) (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= 0 gl_insert_~node~0.offset) (or (= gl_insert_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|))), 20831#(and (= gl_insert_~node~0.offset 0) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 12 (select |#length| gl_insert_~node~0.base)) (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= 1 (select |#valid| gl_insert_~node~0.base)) (or (= gl_insert_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|))), 20832#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base)), 20833#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= 1 (select |#valid| list_add_~head.base)) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base)), 20834#(and (or (<= __list_add_~new.offset 4) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (or (not (= 4 __list_add_~new.offset)) (and (or (= __list_add_~new.base __list_add_~prev.base) (and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|))) (= __list_add_~new.base |__list_add_#in~new.base|) (or (= __list_add_~new.base |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))))) (or (<= |__list_add_#in~new.offset| __list_add_~new.offset) (< 3 __list_add_~new.offset))), 20835#(and (or (<= __list_add_~new.offset 4) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (or (<= |__list_add_#in~new.offset| __list_add_~new.offset) (< 3 __list_add_~new.offset)) (or (not (= 4 __list_add_~new.offset)) (and (= __list_add_~new.base |__list_add_#in~new.base|) (or (= __list_add_~new.base |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (and (= |__list_add_#in~prev.base| (select (select (store |#memory_$Pointer$.base| __list_add_~prev.base (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base)) __list_add_~new.base) (+ __list_add_~new.offset 4))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= |__list_add_#in~prev.offset| (select (select (store |#memory_$Pointer$.offset| __list_add_~prev.base (store (select |#memory_$Pointer$.offset| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.offset)) __list_add_~new.base) (+ __list_add_~new.offset 4))) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (= __list_add_~new.base __list_add_~prev.base))))), 20836#(or (<= 5 |__list_add_#in~new.offset|) (<= |__list_add_#in~new.offset| 3) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) 8)) (= |__list_add_#in~prev.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) 8)))), 20837#(or (<= 5 |list_add_#in~new.offset|) (<= |list_add_#in~new.offset| 3) (and (= 1 (select |#valid| |list_add_#in~head.base|)) (or (and (= |list_add_#in~head.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) 8)) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) 8))) (= |list_add_#in~new.base| |list_add_#in~head.base|)))), 20838#(and (= 1 (select |#valid| |~#gl_list.base|)) (or (= (select |old(#valid)| |~#gl_list.base|) 0) (and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= (select |old(#length)| |~#gl_list.base|) (select |#length| |~#gl_list.base|))))), 20839#(and (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 8 (select |#length| |~#gl_list.base|))), 20840#(= list_empty_~head.base |list_empty_#in~head.base|), 20841#(or (not (= |gl_sort_#t~ret28| 0)) (and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (not (= 0 (select |#valid| |~#gl_list.base|))) (= 8 (select |#length| |~#gl_list.base|)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))))), 20842#(and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (not (= 0 (select |#valid| |~#gl_list.base|))) (= 8 (select |#length| |~#gl_list.base|)) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 20843#(and (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) 8)) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (= 8 (select |#length| |~#gl_list.base|)) (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) 8))), 20844#(and (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (= 8 (select |#length| |~#gl_list.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) 8))), 20845#(and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 8)) (= 8 (select |#length| |~#gl_list.base|))), 20846#(= |gl_seek_max_#t~mem23.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)), 20847#(= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)), 20848#(and (<= (+ val_from_node_~entry~0.offset 4) |val_from_node_#in~head.offset|) (= val_from_node_~entry~0.base |val_from_node_#in~head.base|)), 20849#(<= 4 |val_from_node_#in~head.offset|), 20850#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (<= 4 gl_seek_max_~max_pos~0.offset)), 20851#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (<= 4 gl_seek_max_~max_pos~0.offset) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) |gl_seek_max_#t~mem25.base|)), 20852#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) gl_seek_max_~pos~0.base) (<= 4 gl_seek_max_~max_pos~0.offset)), 20853#(and (= gl_seek_max_~max_pos~0.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (<= 4 gl_seek_max_~max_pos~0.offset) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 20854#(and (= |gl_seek_max_#res.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|) |~#gl_list.base|) (<= 4 |gl_seek_max_#res.offset|)), 20855#(and (<= (select |#length| |gl_sort_#t~ret29.base|) 12) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_#t~ret29.base|) 8)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) 8))) (<= 4 |gl_sort_#t~ret29.offset|)), 20856#(and (= 0 (select (select |#memory_$Pointer$.offset| gl_sort_~max_pos~1.base) 8)) (<= 4 gl_sort_~max_pos~1.offset) (<= (select |#length| gl_sort_~max_pos~1.base) 12) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) 8)))), 20857#(and (<= (select |#length| |list_move_#in~list.base|) 12) (<= 4 |list_move_#in~list.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) 8))) (= 0 (select (select |#memory_$Pointer$.offset| |list_move_#in~list.base|) 8))), 20858#(and (< 3 list_move_~list.offset) (or (not (= list_move_~list.offset 4)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_move_~list.base) (+ list_move_~list.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| list_move_~list.base) (+ list_move_~list.offset 4))))) (or (<= list_move_~list.offset 4) (<= (select |#length| list_move_~list.base) 12))), 20859#(and (= 0 |list_move_#t~mem12.offset|) (= 8 (select |#length| |list_move_#t~mem12.base|)) (<= list_move_~list.offset 4) (< 3 list_move_~list.offset)), 20860#(and (= 0 |list_move_#t~mem12.offset|) (= 8 (select |#length| |list_move_#t~mem12.base|))), 20861#(and (= 0 |__list_del_#in~prev.offset|) (= 8 (select |#length| |__list_del_#in~prev.base|))), 20862#(and (= (select |#length| __list_del_~prev.base) 8) (= __list_del_~prev.offset 0))] [2018-02-02 20:04:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:04:51,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 20:04:51,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 20:04:51,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:04:51,650 INFO L87 Difference]: Start difference. First operand 371 states and 426 transitions. Second operand 39 states. [2018-02-02 20:04:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:04:57,423 INFO L93 Difference]: Finished difference Result 428 states and 478 transitions. [2018-02-02 20:04:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-02 20:04:57,423 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 86 [2018-02-02 20:04:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:04:57,424 INFO L225 Difference]: With dead ends: 428 [2018-02-02 20:04:57,424 INFO L226 Difference]: Without dead ends: 428 [2018-02-02 20:04:57,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=902, Invalid=8410, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 20:04:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-02 20:04:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 371. [2018-02-02 20:04:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-02 20:04:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2018-02-02 20:04:57,430 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 86 [2018-02-02 20:04:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:04:57,430 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2018-02-02 20:04:57,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 20:04:57,430 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2018-02-02 20:04:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:04:57,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:04:57,431 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 20:04:57,431 INFO L371 AbstractCegarLoop]: === Iteration 42 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:04:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash 540132495, now seen corresponding path program 1 times [2018-02-02 20:04:57,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:04:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:04:57,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:04:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:04:58,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:04:58,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 20:04:58,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:04:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:04:58,962 INFO L182 omatonBuilderFactory]: Interpolants [21782#true, 21783#false, 21784#(and (= 12 (select |#length| |gl_insert_#t~malloc14.base|)) (= 0 |gl_insert_#t~malloc14.offset|)), 21785#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 21786#(and (= gl_insert_~node~0.offset 0) (= (select |#valid| gl_insert_~node~0.base) 1) (= 12 (select |#length| gl_insert_~node~0.base))), 21787#(and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset)), 21788#(and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#valid| list_add_~head.base) 1)), 21789#(and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 21790#(and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))), 21791#(and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (select |#valid| |list_add_#in~head.base|) 1) (<= |list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 21792#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 1) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= (select |#valid| |~#gl_list.base|) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 21793#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21794#(and (= 0 (select |old(#valid)| |gl_insert_#t~malloc14.base|)) (= |#length| (store |old(#length)| |gl_insert_#t~malloc14.base| (select |#length| |gl_insert_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21795#(and (= 0 (select |old(#valid)| gl_insert_~node~0.base)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= gl_insert_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21796#(and (= 0 (select |old(#valid)| gl_insert_~node~0.base)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~0.base (select |#memory_$Pointer$.offset| gl_insert_~node~0.base)) |#memory_$Pointer$.offset|) (= 1 (select |#valid| gl_insert_~node~0.base)) (or (= gl_insert_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= (store |old(#memory_$Pointer$.base)| gl_insert_~node~0.base (select |#memory_$Pointer$.base| gl_insert_~node~0.base)) |#memory_$Pointer$.base|)), 21797#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21798#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 21799#(and (= |list_add_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |#valid| |list_add_#in~head.base|) 1) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#t~mem7.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~new.base| list_add_~new.base)), 21800#(and (or (= __list_add_~next.offset |__list_add_#in~next.offset|) (= __list_add_~new.base __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 21801#(and (or (= __list_add_~new.base __list_add_~prev.base) (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (or (and (= 1 (select |#valid| __list_add_~next.base)) (<= (+ __list_add_~next.offset 8) (select |#length| __list_add_~next.base))) (not (= (select |#length| __list_add_~next.base) 12))))) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 21802#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (or (and (<= |__list_add_#in~next.offset| (select (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset) __list_add_~new.offset)) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset))) (<= (select (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset) __list_add_~new.offset) 4) (= (select |#length| |__list_add_#in~next.base|) (select |#length| (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset)))) (not (= (select |#length| |__list_add_#in~next.base|) 12)))) (= __list_add_~new.base __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 21803#(and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (and (or (not (= (select |#length| |__list_add_#in~next.base|) 12)) (and (= (select |#length| |__list_add_#in~next.base|) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) 4) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))))) (<= |__list_add_#in~next.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))))), 21804#(and (= (select |#valid| |list_add_#in~head.base|) 1) (or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (= (select |#length| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) 4)) (not (= (select |#length| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) 12))) (<= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))))) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 21805#(or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (or (not (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) 12)) (and (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) 4) (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))))))), 21806#(and (= (select |#valid| |~#gl_list.base|) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (<= 4 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) 4) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))), 21807#(= list_empty_~head.base |list_empty_#in~head.base|), 21808#(and (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (<= 4 (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (<= (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)) 4)), 21809#(and (<= (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)) 4) (not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))) (<= 4 (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))), 21810#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (<= 4 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) 4)), 21811#(and (= list_empty_~head.offset |list_empty_#in~head.offset|) (= list_empty_~head.base |list_empty_#in~head.base|)), 21812#(and (= (select (select |#memory_$Pointer$.base| list_empty_~head.base) |list_empty_#in~head.offset|) |list_empty_#t~mem0.base|) (= list_empty_~head.base |list_empty_#in~head.base|)), 21813#(or (= (select (select |#memory_$Pointer$.base| |list_empty_#in~head.base|) |list_empty_#in~head.offset|) |list_empty_#in~head.base|) (= 0 |list_empty_#res|)), 21814#(or (= |gl_seek_max_#t~ret22| 1) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (<= 4 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) 4))), 21815#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (<= 4 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) 4)), 21816#(and (<= 4 (select (select |#memory_$Pointer$.offset| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|))) (<= (select (select |#memory_$Pointer$.offset| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|) 4)), 21817#(and (<= (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) 4) (<= 4 (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)))), 21818#(and (= 12 (select |#length| |gl_seek_max_#t~mem25.base|)) (<= |gl_seek_max_#t~mem25.offset| 4) (<= 4 |gl_seek_max_#t~mem25.offset|)), 21819#(and (= 12 (select |#length| gl_seek_max_~pos~0.base)) (<= 4 gl_seek_max_~pos~0.offset) (<= gl_seek_max_~pos~0.offset 4)), 21820#(and (<= |val_from_node_#in~head.offset| 4) (= 12 (select |#length| |val_from_node_#in~head.base|)) (<= 4 |val_from_node_#in~head.offset|)), 21821#(and (= (select |#length| val_from_node_~entry~0.base) 12) (<= 0 val_from_node_~entry~0.offset) (<= val_from_node_~entry~0.offset 0))] [2018-02-02 20:04:58,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:04:58,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 20:04:58,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 20:04:58,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1464, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:04:58,963 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand 40 states. [2018-02-02 20:05:02,484 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 42 DAG size of output 41 [2018-02-02 20:05:03,673 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-02-02 20:05:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:05,247 INFO L93 Difference]: Finished difference Result 423 states and 474 transitions. [2018-02-02 20:05:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:05:05,247 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 102 [2018-02-02 20:05:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:05,248 INFO L225 Difference]: With dead ends: 423 [2018-02-02 20:05:05,248 INFO L226 Difference]: Without dead ends: 423 [2018-02-02 20:05:05,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=555, Invalid=5925, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 20:05:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-02-02 20:05:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 371. [2018-02-02 20:05:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-02 20:05:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 422 transitions. [2018-02-02 20:05:05,254 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 422 transitions. Word has length 102 [2018-02-02 20:05:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:05,255 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 422 transitions. [2018-02-02 20:05:05,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 20:05:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 422 transitions. [2018-02-02 20:05:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 20:05:05,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:05,256 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:05,256 INFO L371 AbstractCegarLoop]: === Iteration 43 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1592718148, now seen corresponding path program 1 times [2018-02-02 20:05:05,257 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:05,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:05,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:05,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:05:05,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:05,313 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 20:05:05,313 INFO L182 omatonBuilderFactory]: Interpolants [22704#(= (select |#valid| |gl_sort_~#dst~0.base|) 1), 22705#(= 1 (select |#valid| |list_move_#in~head.base|)), 22706#(= 1 (select |#valid| list_move_~head.base)), 22707#(= 1 (select |#valid| |list_add_#in~head.base|)), 22708#(= 1 (select |#valid| list_add_~head.base)), 22702#true, 22703#false] [2018-02-02 20:05:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:05,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:05,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:05,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:05,314 INFO L87 Difference]: Start difference. First operand 371 states and 422 transitions. Second operand 7 states. [2018-02-02 20:05:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:05,446 INFO L93 Difference]: Finished difference Result 370 states and 421 transitions. [2018-02-02 20:05:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:05:05,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-02 20:05:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:05,447 INFO L225 Difference]: With dead ends: 370 [2018-02-02 20:05:05,447 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 20:05:05,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 20:05:05,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2018-02-02 20:05:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 20:05:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 421 transitions. [2018-02-02 20:05:05,451 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 421 transitions. Word has length 92 [2018-02-02 20:05:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:05,452 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 421 transitions. [2018-02-02 20:05:05,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 421 transitions. [2018-02-02 20:05:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 20:05:05,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:05,453 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:05,453 INFO L371 AbstractCegarLoop]: === Iteration 44 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1592718147, now seen corresponding path program 1 times [2018-02-02 20:05:05,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:05,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:05,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:05,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:05:05,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:05,538 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 20:05:05,538 INFO L182 omatonBuilderFactory]: Interpolants [23456#(and (= 0 |gl_sort_~#dst~0.offset|) (= 8 (select |#length| |gl_sort_~#dst~0.base|))), 23457#(and (= 8 (select |#length| |list_move_#in~head.base|)) (= 0 |list_move_#in~head.offset|)), 23458#(and (= 0 list_move_~head.offset) (= 8 (select |#length| list_move_~head.base))), 23459#(and (= 0 |list_add_#in~head.offset|) (= 8 (select |#length| |list_add_#in~head.base|))), 23460#(and (= (select |#length| list_add_~head.base) 8) (= list_add_~head.offset 0)), 23454#true, 23455#false] [2018-02-02 20:05:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:05,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:05,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:05,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:05,539 INFO L87 Difference]: Start difference. First operand 370 states and 421 transitions. Second operand 7 states. [2018-02-02 20:05:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:05,687 INFO L93 Difference]: Finished difference Result 369 states and 420 transitions. [2018-02-02 20:05:05,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:05:05,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-02 20:05:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:05,688 INFO L225 Difference]: With dead ends: 369 [2018-02-02 20:05:05,688 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 20:05:05,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 20:05:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-02-02 20:05:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 20:05:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 420 transitions. [2018-02-02 20:05:05,692 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 420 transitions. Word has length 92 [2018-02-02 20:05:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:05,692 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 420 transitions. [2018-02-02 20:05:05,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 420 transitions. [2018-02-02 20:05:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:05:05,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:05,693 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:05,693 INFO L371 AbstractCegarLoop]: === Iteration 45 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2132545757, now seen corresponding path program 1 times [2018-02-02 20:05:05,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:05,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:05:06,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:06,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:05:06,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:06,256 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 20:05:06,256 INFO L182 omatonBuilderFactory]: Interpolants [24203#true, 24204#false, 24205#(= list_add_~head.base |list_add_#in~head.base|), 24206#(and (= list_add_~head.base |list_add_#in~head.base|) (= 1 (select |#valid| list_add_~head.base))), 24207#(= 1 (select |#valid| |list_add_#in~head.base|)), 24208#(= 1 (select |#valid| |~#gl_list.base|)), 24209#(= list_empty_~head.base |list_empty_#in~head.base|), 24210#(or (not (= 0 (select |#valid| |~#gl_list.base|))) (not (= |gl_sort_#t~ret28| 0))), 24211#(not (= 0 (select |#valid| |~#gl_list.base|))), 24212#(not (= |~#gl_list.base| |gl_sort_~#dst~0.base|)), 24213#(and (= |gl_sort_~#dst~0.base| (select (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= (select |#valid| |gl_sort_~#dst~0.base|) 1) (not (= |~#gl_list.base| |gl_sort_~#dst~0.base|))), 24214#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))) (not (= |~#gl_list.base| |gl_sort_~#dst~0.base|))), 24215#(and (= 1 (select |#valid| |~#gl_list.base|)) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) |gl_seek_max_#t~mem25.base|)), 24216#(and (= 1 (select |#valid| |~#gl_list.base|)) (= gl_seek_max_~pos~0.base (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 24217#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) |~#gl_list.base|)), 24218#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|))) (= (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|) |~#gl_list.base|)), 24219#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|) |gl_sort_~#dst~0.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|)))), 24220#(and (not (= (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset) |gl_sort_~#dst~0.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)))), 24221#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) |list_move_#in~list.offset|))) (not (= (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) |list_move_#in~list.offset|) |list_move_#in~head.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_move_#in~head.base|) |list_move_#in~head.offset|)))), 24222#(and (not (= (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset) list_move_~head.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_move_~head.base) list_move_~head.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset)))), 24223#(and (not (= (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset) list_move_~head.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_move_~head.base) list_move_~head.offset))) (= 1 (select |#valid| |list_move_#t~mem13.base|)) (= |list_move_#t~mem13.base| (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset))), 24224#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 24225#(and (= |__list_del_#in~next.base| __list_del_~next.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24226#(and (= |__list_del_#in~next.base| __list_del_~next.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| __list_del_~next.base (select |#memory_$Pointer$.base| __list_del_~next.base)))), 24227#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (and (= |__list_del_#in~next.base| (select (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))))) (= (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (store (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (select (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))))))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |__list_del_#in~next.base|)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |__list_del_#in~next.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (and (= (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (store (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (select (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))) (= |__list_del_#in~next.base| (select (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))))), 24228#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_move_~head.base) list_move_~head.offset))), 24229#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 24230#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))), 24231#(= 1 (select |#valid| |list_add_#t~mem7.base|)), 24232#(= 1 (select |#valid| |__list_add_#in~next.base|)), 24233#(= 1 (select |#valid| __list_add_~next.base))] [2018-02-02 20:05:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:05:06,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:05:06,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:05:06,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:05:06,257 INFO L87 Difference]: Start difference. First operand 369 states and 420 transitions. Second operand 31 states. [2018-02-02 20:05:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:07,806 INFO L93 Difference]: Finished difference Result 407 states and 463 transitions. [2018-02-02 20:05:07,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:05:07,806 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 95 [2018-02-02 20:05:07,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:07,807 INFO L225 Difference]: With dead ends: 407 [2018-02-02 20:05:07,807 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 20:05:07,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=458, Invalid=3574, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:05:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 20:05:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2018-02-02 20:05:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:05:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 440 transitions. [2018-02-02 20:05:07,812 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 440 transitions. Word has length 95 [2018-02-02 20:05:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:07,812 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 440 transitions. [2018-02-02 20:05:07,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:05:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 440 transitions. [2018-02-02 20:05:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:05:07,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:07,813 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:07,813 INFO L371 AbstractCegarLoop]: === Iteration 46 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2132545758, now seen corresponding path program 1 times [2018-02-02 20:05:07,813 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:07,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:08,947 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 113 DAG size of output 69 [2018-02-02 20:05:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:09,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:09,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:05:09,148 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:09,148 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 20:05:09,148 INFO L182 omatonBuilderFactory]: Interpolants [25094#true, 25095#false, 25096#(= 0 |~#gl_list.offset|), 25097#(= list_add_~head.base |list_add_#in~head.base|), 25098#(and (= list_add_~head.base |list_add_#in~head.base|) (= 1 (select |#valid| list_add_~head.base))), 25099#(= __list_add_~prev.base |__list_add_#in~prev.base|), 25100#(= 1 (select |#valid| |list_add_#in~head.base|)), 25101#(= 1 (select |#valid| |~#gl_list.base|)), 25102#(and (= 1 (select |#valid| |~#gl_list.base|)) (= 0 |~#gl_list.offset|)), 25103#(= list_empty_~head.base |list_empty_#in~head.base|), 25104#(or (not (= |gl_sort_#t~ret28| 0)) (and (= 0 |~#gl_list.offset|) (not (= 0 (select |#valid| |~#gl_list.base|))))), 25105#(and (= 0 |~#gl_list.offset|) (not (= 0 (select |#valid| |~#gl_list.base|)))), 25106#(and (= 0 |gl_sort_~#dst~0.offset|) (= 0 |~#gl_list.offset|) (= 8 (select |#length| |gl_sort_~#dst~0.base|)) (not (= |~#gl_list.base| |gl_sort_~#dst~0.base|))), 25107#(and (= 8 (select |#length| (select (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))) (= 0 |~#gl_list.offset|) (= 0 (select (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|) |gl_sort_~#dst~0.offset|)) (not (= |~#gl_list.base| |gl_sort_~#dst~0.base|))), 25108#(and (= |gl_seek_max_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) |gl_seek_max_#t~mem25.base|)), 25109#(and (= gl_seek_max_~pos~0.base (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= gl_seek_max_~pos~0.offset (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 25110#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (= (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset) |~#gl_list.base|)), 25111#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|)) (= (select (select |#memory_$Pointer$.base| |gl_seek_max_#res.base|) |gl_seek_max_#res.offset|) |~#gl_list.base|)), 25112#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|) |gl_sort_~#dst~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_#t~ret29.base|) |gl_sort_#t~ret29.offset|))), 25113#(and (not (= (select (select |#memory_$Pointer$.base| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset) |gl_sort_~#dst~0.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| gl_sort_~max_pos~1.base) gl_sort_~max_pos~1.offset))), 25114#(and (= 0 (select (select |#memory_$Pointer$.offset| |list_move_#in~head.base|) |list_move_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| |list_move_#in~list.base|) |list_move_#in~list.offset|) |list_move_#in~head.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |list_move_#in~head.base|) |list_move_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |list_move_#in~list.base|) |list_move_#in~list.offset|))), 25115#(and (= 0 (select (select |#memory_$Pointer$.offset| list_move_~list.base) list_move_~list.offset)) (not (= (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset) list_move_~head.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_move_~head.base) list_move_~head.offset))) (= 0 (select (select |#memory_$Pointer$.offset| list_move_~head.base) list_move_~head.offset))), 25116#(and (not (= (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset) list_move_~head.base)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_move_~head.base) list_move_~head.offset))) (= 0 |list_move_#t~mem13.offset|) (= 0 (select (select |#memory_$Pointer$.offset| list_move_~head.base) list_move_~head.offset)) (= |list_move_#t~mem13.base| (select (select |#memory_$Pointer$.base| list_move_~list.base) list_move_~list.offset))), 25117#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25118#(and (= |__list_del_#in~next.offset| __list_del_~next.offset) (= |__list_del_#in~next.base| __list_del_~next.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25119#(and (= (store |old(#memory_$Pointer$.offset)| __list_del_~next.base (select |#memory_$Pointer$.offset| __list_del_~next.base)) |#memory_$Pointer$.offset|) (= |__list_del_#in~next.offset| __list_del_~next.offset) (or (<= (+ __list_del_~next.offset 8) (select |#length| __list_del_~next.base)) (not (= __list_del_~next.offset 0))) (= |__list_del_#in~next.base| __list_del_~next.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| __list_del_~next.base (select |#memory_$Pointer$.base| __list_del_~next.base)))), 25120#(and (or (and (= (store (select |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (select (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))))) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (or (<= 8 (select |#length| |__list_del_#in~next.base|)) (not (= |__list_del_#in~next.offset| 0))) (= |__list_del_#in~next.offset| (select (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |__list_del_#in~next.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (and (= |__list_del_#in~next.offset| (select (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))))) (= (store (select |old(#memory_$Pointer$.offset)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (select (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (@diff (select |old(#memory_$Pointer$.offset)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))))) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (or (<= 8 (select |#length| |__list_del_#in~next.base|)) (not (= |__list_del_#in~next.offset| 0)))) (= (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |__list_del_#in~next.base|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (and (= |__list_del_#in~next.base| (select (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))))) (or (<= 8 (select |#length| |__list_del_#in~next.base|)) (not (= |__list_del_#in~next.offset| 0))) (= (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (store (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (select (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))))))) (= (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |__list_del_#in~next.base|)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |__list_del_#in~next.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (and (= (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (store (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (select (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))) (= |__list_del_#in~next.base| (select (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (@diff (select |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (or (<= 8 (select |#length| |__list_del_#in~next.base|)) (not (= |__list_del_#in~next.offset| 0)))))), 25121#(and (= 0 (select (select |#memory_$Pointer$.offset| list_move_~head.base) list_move_~head.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_move_~head.base) list_move_~head.offset)))), 25122#(and (= 0 (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)))), 25123#(and (= 0 (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)))), 25124#(and (= 0 |list_add_#t~mem7.offset|) (<= 8 (select |#length| |list_add_#t~mem7.base|))), 25125#(and (= 0 |__list_add_#in~next.offset|) (<= 8 (select |#length| |__list_add_#in~next.base|))), 25126#(and (= __list_add_~next.offset 0) (<= 8 (select |#length| __list_add_~next.base)))] [2018-02-02 20:05:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:09,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:05:09,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:05:09,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:05:09,149 INFO L87 Difference]: Start difference. First operand 383 states and 440 transitions. Second operand 33 states. [2018-02-02 20:05:10,380 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 76 [2018-02-02 20:05:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:11,556 INFO L93 Difference]: Finished difference Result 406 states and 462 transitions. [2018-02-02 20:05:11,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:05:11,557 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 95 [2018-02-02 20:05:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:11,558 INFO L225 Difference]: With dead ends: 406 [2018-02-02 20:05:11,558 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 20:05:11,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=486, Invalid=3674, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:05:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 20:05:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 383. [2018-02-02 20:05:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:05:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 439 transitions. [2018-02-02 20:05:11,563 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 439 transitions. Word has length 95 [2018-02-02 20:05:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:11,563 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 439 transitions. [2018-02-02 20:05:11,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:05:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 439 transitions. [2018-02-02 20:05:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 20:05:11,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:11,564 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:11,564 INFO L371 AbstractCegarLoop]: === Iteration 47 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:11,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1684409001, now seen corresponding path program 1 times [2018-02-02 20:05:11,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:11,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:11,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:11,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:05:11,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:11,667 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 20:05:11,667 INFO L182 omatonBuilderFactory]: Interpolants [25984#true, 25985#false, 25986#(= 1 (select |#valid| gl_seek_max_~max_pos~0.base)), 25987#(= 1 (select |#valid| |gl_seek_max_#res.base|)), 25988#(= 1 (select |#valid| |gl_sort_#t~ret29.base|)), 25989#(= 1 (select |#valid| gl_sort_~max_pos~1.base)), 25990#(= 1 (select |#valid| |list_move_#in~list.base|)), 25991#(= 1 (select |#valid| list_move_~list.base)), 25992#(= 1 (select |#valid| |list_add_#in~new.base|)), 25993#(= 1 (select |#valid| list_add_~new.base)), 25994#(= 1 (select |#valid| |__list_add_#in~new.base|)), 25995#(= 1 (select |#valid| __list_add_~new.base))] [2018-02-02 20:05:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:11,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:05:11,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:05:11,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:05:11,668 INFO L87 Difference]: Start difference. First operand 383 states and 439 transitions. Second operand 12 states. [2018-02-02 20:05:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:12,110 INFO L93 Difference]: Finished difference Result 399 states and 452 transitions. [2018-02-02 20:05:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:05:12,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-02-02 20:05:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:12,112 INFO L225 Difference]: With dead ends: 399 [2018-02-02 20:05:12,112 INFO L226 Difference]: Without dead ends: 399 [2018-02-02 20:05:12,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:05:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-02-02 20:05:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 382. [2018-02-02 20:05:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-02 20:05:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 437 transitions. [2018-02-02 20:05:12,118 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 437 transitions. Word has length 96 [2018-02-02 20:05:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:12,118 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 437 transitions. [2018-02-02 20:05:12,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:05:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 437 transitions. [2018-02-02 20:05:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 20:05:12,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:12,119 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:12,120 INFO L371 AbstractCegarLoop]: === Iteration 48 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1684409002, now seen corresponding path program 1 times [2018-02-02 20:05:12,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:12,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:12,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:12,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 20:05:12,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:12,465 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 20:05:12,465 INFO L182 omatonBuilderFactory]: Interpolants [26788#true, 26789#false, 26790#(and (<= (+ val_from_node_~entry~0.offset 4) |val_from_node_#in~head.offset|) (= val_from_node_~entry~0.base |val_from_node_#in~head.base|)), 26791#(<= 4 |val_from_node_#in~head.offset|), 26792#(<= 4 gl_seek_max_~max_pos~0.offset), 26793#(and (<= 4 gl_seek_max_~max_pos~0.offset) (<= (+ gl_seek_max_~max_pos~0.offset 4) (select |#length| gl_seek_max_~max_pos~0.base))), 26794#(and (<= (+ |gl_seek_max_#res.offset| 4) (select |#length| |gl_seek_max_#res.base|)) (<= 4 |gl_seek_max_#res.offset|)), 26795#(and (<= (+ |gl_sort_#t~ret29.offset| 4) (select |#length| |gl_sort_#t~ret29.base|)) (<= 4 |gl_sort_#t~ret29.offset|)), 26796#(and (<= 4 gl_sort_~max_pos~1.offset) (<= (+ gl_sort_~max_pos~1.offset 4) (select |#length| gl_sort_~max_pos~1.base))), 26797#(and (<= 4 |list_move_#in~list.offset|) (<= (+ |list_move_#in~list.offset| 4) (select |#length| |list_move_#in~list.base|))), 26798#(and (<= 4 list_move_~list.offset) (<= (+ list_move_~list.offset 4) (select |#length| list_move_~list.base))), 26799#(and (<= 4 |list_add_#in~new.offset|) (<= (+ |list_add_#in~new.offset| 4) (select |#length| |list_add_#in~new.base|))), 26800#(and (<= 4 list_add_~new.offset) (<= (+ list_add_~new.offset 4) (select |#length| list_add_~new.base))), 26801#(and (<= (+ |__list_add_#in~new.offset| 4) (select |#length| |__list_add_#in~new.base|)) (<= 4 |__list_add_#in~new.offset|)), 26802#(and (<= 4 __list_add_~new.offset) (<= (+ __list_add_~new.offset 4) (select |#length| __list_add_~new.base)))] [2018-02-02 20:05:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:12,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:05:12,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:05:12,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:05:12,466 INFO L87 Difference]: Start difference. First operand 382 states and 437 transitions. Second operand 15 states. [2018-02-02 20:05:12,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:12,936 INFO L93 Difference]: Finished difference Result 408 states and 458 transitions. [2018-02-02 20:05:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:05:12,937 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2018-02-02 20:05:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:12,938 INFO L225 Difference]: With dead ends: 408 [2018-02-02 20:05:12,938 INFO L226 Difference]: Without dead ends: 408 [2018-02-02 20:05:12,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:05:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-02-02 20:05:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 395. [2018-02-02 20:05:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 20:05:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 448 transitions. [2018-02-02 20:05:12,941 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 448 transitions. Word has length 96 [2018-02-02 20:05:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:12,942 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 448 transitions. [2018-02-02 20:05:12,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:05:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 448 transitions. [2018-02-02 20:05:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:05:12,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:12,942 INFO L351 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:12,942 INFO L371 AbstractCegarLoop]: === Iteration 49 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash 677071457, now seen corresponding path program 1 times [2018-02-02 20:05:12,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:12,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:13,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:13,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:05:13,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:13,046 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 20:05:13,046 INFO L182 omatonBuilderFactory]: Interpolants [27619#true, 27620#false, 27621#(= val_from_node_~entry~0.base |val_from_node_#in~head.base|), 27622#(<= (+ list_move_~list.offset 8) (select |#length| list_move_~list.base)), 27623#(<= (+ |list_add_#in~new.offset| 8) (select |#length| |list_add_#in~new.base|)), 27624#(<= (+ list_add_~new.offset 8) (select |#length| list_add_~new.base)), 27625#(<= (+ |__list_add_#in~new.offset| 8) (select |#length| |__list_add_#in~new.base|)), 27626#(<= (+ __list_add_~new.offset 8) (select |#length| __list_add_~new.base)), 27627#(and (<= (+ __list_add_~new.offset 8) (select |#length| __list_add_~new.base)) (<= 0 __list_add_~new.offset))] [2018-02-02 20:05:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:13,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:05:13,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:05:13,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:13,047 INFO L87 Difference]: Start difference. First operand 395 states and 448 transitions. Second operand 9 states. [2018-02-02 20:05:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:13,304 INFO L93 Difference]: Finished difference Result 398 states and 445 transitions. [2018-02-02 20:05:13,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:05:13,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2018-02-02 20:05:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:13,306 INFO L225 Difference]: With dead ends: 398 [2018-02-02 20:05:13,306 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:05:13,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:05:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:05:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2018-02-02 20:05:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-02 20:05:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 445 transitions. [2018-02-02 20:05:13,310 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 445 transitions. Word has length 97 [2018-02-02 20:05:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:13,310 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 445 transitions. [2018-02-02 20:05:13,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:05:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 445 transitions. [2018-02-02 20:05:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:05:13,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:13,310 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:13,311 INFO L371 AbstractCegarLoop]: === Iteration 50 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -485621363, now seen corresponding path program 1 times [2018-02-02 20:05:13,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:13,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:13,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:13,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:05:13,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:13,428 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 20:05:13,428 INFO L182 omatonBuilderFactory]: Interpolants [28432#(and (= 8 (select |#length| |list_move_#in~head.base|)) (= 0 |list_move_#in~head.offset|)), 28433#(and (= 0 list_move_~head.offset) (= 8 (select |#length| list_move_~head.base))), 28434#(and (= 0 |list_add_#in~head.offset|) (= 8 (select |#length| |list_add_#in~head.base|))), 28435#(and (= 8 (select |#length| list_add_~head.base)) (= 0 list_add_~head.offset)), 28436#(and (= 0 |__list_add_#in~prev.offset|) (= 8 (select |#length| |__list_add_#in~prev.base|))), 28437#(and (= __list_add_~prev.offset 0) (= (select |#length| __list_add_~prev.base) 8)), 28429#true, 28430#false, 28431#(and (= 0 |gl_sort_~#dst~0.offset|) (= 8 (select |#length| |gl_sort_~#dst~0.base|)))] [2018-02-02 20:05:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:05:13,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:05:13,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:05:13,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:13,429 INFO L87 Difference]: Start difference. First operand 395 states and 445 transitions. Second operand 9 states. [2018-02-02 20:05:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:13,669 INFO L93 Difference]: Finished difference Result 394 states and 440 transitions. [2018-02-02 20:05:13,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:05:13,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-02-02 20:05:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:13,670 INFO L225 Difference]: With dead ends: 394 [2018-02-02 20:05:13,670 INFO L226 Difference]: Without dead ends: 394 [2018-02-02 20:05:13,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:05:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-02-02 20:05:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-02-02 20:05:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-02-02 20:05:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 440 transitions. [2018-02-02 20:05:13,677 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 440 transitions. Word has length 98 [2018-02-02 20:05:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:13,677 INFO L432 AbstractCegarLoop]: Abstraction has 394 states and 440 transitions. [2018-02-02 20:05:13,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:05:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 440 transitions. [2018-02-02 20:05:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 20:05:13,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:13,678 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 20:05:13,679 INFO L371 AbstractCegarLoop]: === Iteration 51 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1139012996, now seen corresponding path program 1 times [2018-02-02 20:05:13,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:13,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:05:15,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:15,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 20:05:15,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:15,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:05:15,797 INFO L182 omatonBuilderFactory]: Interpolants [29248#(or (and (= 1 (select |#valid| |~#gl_list.base|)) (or (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (= 0 (select |old(#valid)| |~#gl_list.base|))), 29249#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29250#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| |gl_insert_#t~malloc14.base|) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29251#(and (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29252#(and (= (select |old(#valid)| gl_insert_~node~0.base) 0) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~0.base (select |#memory_$Pointer$.offset| gl_insert_~node~0.base)) |#memory_$Pointer$.offset|) (= 1 (select |#valid| gl_insert_~node~0.base)) (= (store |old(#memory_$Pointer$.base)| gl_insert_~node~0.base (select |#memory_$Pointer$.base| gl_insert_~node~0.base)) |#memory_$Pointer$.base|)), 29253#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29254#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base)), 29255#(and (= |list_add_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= (select (select |#memory_$Pointer$.base| list_add_~head.base) |list_add_#in~head.offset|) |list_add_#t~mem7.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |#valid| |list_add_#in~head.base|) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base)), 29256#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (or (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (= __list_add_~next.base |__list_add_#in~next.base|) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |#memory_$Pointer$.base| __list_add_~next.base) (select |old(#memory_$Pointer$.base)| __list_add_~next.base)) (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~new.base __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 29257#(and (or (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (= 1 (select |#valid| __list_add_~next.base)) (= __list_add_~next.base |__list_add_#in~next.base|) (or (= __list_add_~next.base __list_add_~prev.base) (= __list_add_~next.base __list_add_~new.base) (= (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (store (select |old(#memory_$Pointer$.base)| __list_add_~next.base) (+ __list_add_~next.offset 4) (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4)))))) (= __list_add_~new.base __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 29258#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (= __list_add_~new.base __list_add_~prev.base) (and (= (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset))) (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset)) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset))))) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset))) (= (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset) |__list_add_#in~next.base|) (= 1 (select |#valid| |__list_add_#in~next.base|)) (or (not (= (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset))) |__list_add_#in~next.offset|)) (= (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset)))) (= (select (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset) __list_add_~new.offset) |__list_add_#in~next.offset|)))), 29259#(or (and (or (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) |__list_add_#in~next.base|) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) |__list_add_#in~next.offset|) (= 1 (select |#valid| |__list_add_#in~next.base|)) (or (not (= (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))) |__list_add_#in~next.offset|)) (= (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (and (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|))), 29260#(or (and (or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (and (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (or (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (not (= (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))))))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= (select |#valid| |list_add_#in~head.base|) 1)) (and (= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (= |list_add_#in~new.base| |list_add_#in~head.base|))), 29261#(or (and (= (select |old(#valid)| |~#gl_list.base|) 0) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (and (= (select |#valid| |~#gl_list.base|) 1) (or (and (or (and (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (store (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))))) (or (= (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= (@diff (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|))) (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (= (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) 0)) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 29262#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (or (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))))), 29263#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))), 29264#(and (= list_empty_~head.offset |list_empty_#in~head.offset|) (= list_empty_~head.base |list_empty_#in~head.base|)), 29265#(and (= (select (select |#memory_$Pointer$.base| list_empty_~head.base) |list_empty_#in~head.offset|) |list_empty_#t~mem0.base|) (= list_empty_~head.base |list_empty_#in~head.base|)), 29266#(and (or (= 1 |list_empty_#res|) (= 0 |list_empty_#res|)) (or (= (select (select |#memory_$Pointer$.base| |list_empty_#in~head.base|) |list_empty_#in~head.offset|) |list_empty_#in~head.base|) (= 0 |list_empty_#res|))), 29267#(or (= |gl_sort_#t~ret28| 1) (and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))))), 29268#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 29269#(and (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|))) (not (= |gl_sort_~#dst~0.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset| |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))))), 29270#(= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|))) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) (select (select (store |#memory_$Pointer$.base| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.base|)) |~#gl_list.base|) |~#gl_list.offset|)) (select (select (store |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base| (store (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4) |gl_sort_~#dst~0.offset|)) |~#gl_list.base|) |~#gl_list.offset|)))), 29271#(= |~#gl_list.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)))), 29272#(= list_empty_~head.base |list_empty_#in~head.base|), 29273#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|)) (select (select |#memory_$Pointer$.offset| |gl_seek_max_#t~mem23.base|) |gl_seek_max_#t~mem23.offset|)))), 29274#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)) (select (select |#memory_$Pointer$.offset| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)))), 29275#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_seek_max_#t~mem25.base|) |gl_seek_max_#t~mem25.offset|))), 29276#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_seek_max_~pos~0.base) gl_seek_max_~pos~0.offset))), 29277#(= 1 (select |#valid| |gl_seek_max_#t~mem26.base|)), 29278#(= 1 (select |#valid| gl_seek_max_~pos~0.base)), 29279#(= 1 (select |#valid| |val_from_node_#in~head.base|)), 29280#(= 1 (select |#valid| val_from_node_~entry~0.base)), 29233#true, 29234#false, 29235#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.base| (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|))), 29236#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 29237#(and (= 0 (select |old(#valid)| |gl_insert_#t~malloc14.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 29238#(and (= 0 (select |old(#valid)| gl_insert_~node~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 29239#(and (= 0 (select |old(#valid)| gl_insert_~node~0.base)) (= 1 (select |#valid| gl_insert_~node~0.base)) (= (store |old(#memory_$Pointer$.base)| gl_insert_~node~0.base (select |#memory_$Pointer$.base| gl_insert_~node~0.base)) |#memory_$Pointer$.base|)), 29240#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 29241#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#in~new.base| list_add_~new.base)), 29242#(and (= |list_add_#in~head.base| list_add_~head.base) (= 1 (select |#valid| list_add_~head.base)) (= |list_add_#in~head.offset| list_add_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |list_add_#t~mem7.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~new.base| list_add_~new.base)), 29243#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (= __list_add_~next.base |__list_add_#in~next.base|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= __list_add_~new.base __list_add_~prev.base))), 29244#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= __list_add_~next.base |__list_add_#in~next.base|)) (= __list_add_~new.base __list_add_~prev.base))), 29245#(and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (= |__list_add_#in~next.base| (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset)) (or (= __list_add_~prev.base (select (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base) __list_add_~new.offset)) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)))) (= __list_add_~new.base __list_add_~prev.base))), 29246#(and (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.base|) (or (= |__list_add_#in~prev.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (= |__list_add_#in~next.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))))), 29247#(and (or (= |list_add_#in~new.base| |list_add_#in~head.base|) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.base|) (= 1 (select |#valid| |list_add_#in~head.base|)))] [2018-02-02 20:05:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:05:15,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 20:05:15,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 20:05:15,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:05:15,798 INFO L87 Difference]: Start difference. First operand 394 states and 440 transitions. Second operand 48 states. [2018-02-02 20:05:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:21,830 INFO L93 Difference]: Finished difference Result 554 states and 626 transitions. [2018-02-02 20:05:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 20:05:21,830 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 114 [2018-02-02 20:05:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:21,831 INFO L225 Difference]: With dead ends: 554 [2018-02-02 20:05:21,831 INFO L226 Difference]: Without dead ends: 554 [2018-02-02 20:05:21,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=665, Invalid=7345, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 20:05:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-02-02 20:05:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 494. [2018-02-02 20:05:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-02-02 20:05:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 564 transitions. [2018-02-02 20:05:21,840 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 564 transitions. Word has length 114 [2018-02-02 20:05:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:21,840 INFO L432 AbstractCegarLoop]: Abstraction has 494 states and 564 transitions. [2018-02-02 20:05:21,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 20:05:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 564 transitions. [2018-02-02 20:05:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 20:05:21,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:21,841 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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 20:05:21,841 INFO L371 AbstractCegarLoop]: === Iteration 52 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 20:05:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1139012997, now seen corresponding path program 1 times [2018-02-02 20:05:21,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:21,885 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 20:05:22,832 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:05:22,836 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:05:22,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:05:22 BoogieIcfgContainer [2018-02-02 20:05:22,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:05:22,836 INFO L168 Benchmark]: Toolchain (without parser) took 69810.37 ms. Allocated memory was 400.6 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 357.4 MB in the beginning and 931.9 MB in the end (delta: -574.5 MB). Peak memory consumption was 538.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:05:22,837 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.6 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:05:22,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.07 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 345.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:05:22,838 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 400.6 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:05:22,838 INFO L168 Benchmark]: RCFGBuilder took 478.82 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 299.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:05:22,838 INFO L168 Benchmark]: TraceAbstraction took 69116.45 ms. Allocated memory was 400.6 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 299.3 MB in the beginning and 931.9 MB in the end (delta: -632.6 MB). Peak memory consumption was 479.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:05:22,839 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.14 ms. Allocated memory is still 400.6 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 181.07 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 345.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.30 ms. Allocated memory is still 400.6 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 478.82 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 299.3 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69116.45 ms. Allocated memory was 400.6 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 299.3 MB in the beginning and 931.9 MB in the end (delta: -632.6 MB). Peak memory consumption was 479.9 MB. 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 631). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 714). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 115 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 17 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 179 locations, 55 error locations. TIMEOUT Result, 69.0s OverallTime, 52 OverallIterations, 3 TraceHistogramMax, 51.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6905 SDtfs, 9688 SDslu, 37623 SDs, 0 SdLazy, 65218 SolverSat, 2811 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1562 GetRequests, 219 SyntacticMatches, 41 SemanticMatches, 1302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12464 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 252/317 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 1110 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3101 NumberOfCodeBlocks, 3101 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3050 ConstructedInterpolants, 0 QuantifiedInterpolants, 2454891 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 43 PerfectInterpolantSequences, 252/317 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/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-05-22-845.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-05-22-845.csv Completed graceful shutdown