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-0137_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:59:48,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:59:48,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:59:48,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:59:48,126 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:59:48,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:59:48,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:59:48,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:59:48,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:59:48,130 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:59:48,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:59:48,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:59:48,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:59:48,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:59:48,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:59:48,135 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:59:48,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:59:48,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:59:48,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:59:48,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:59:48,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:59:48,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:59:48,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:59:48,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:59:48,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:59:48,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:59:48,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:59:48,146 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:59:48,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:59:48,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:59:48,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:59:48,147 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-04 01:59:48,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:59:48,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:59:48,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:59:48,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:59:48,157 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:59:48,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:59:48,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:59:48,157 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:59:48,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:59:48,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:59:48,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:59:48,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:59:48,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:59:48,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:59:48,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:59:48,160 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:59:48,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:59:48,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:59:48,198 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:59:48,201 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:59:48,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:59:48,203 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:59:48,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0137_false-valid-deref.i [2018-02-04 01:59:48,340 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:59:48,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:59:48,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:59:48,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:59:48,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:59:48,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1454e27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48, skipping insertion in model container [2018-02-04 01:59:48,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,358 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:59:48,387 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:59:48,487 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:59:48,507 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:59:48,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48 WrapperNode [2018-02-04 01:59:48,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:59:48,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:59:48,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:59:48,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:59:48,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (1/1) ... [2018-02-04 01:59:48,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:59:48,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:59:48,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:59:48,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:59:48,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (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-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 01:59:48,588 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 01:59:48,589 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 01:59:48,589 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 01:59:48,589 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-04 01:59:48,589 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 01:59:48,589 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 01:59:48,589 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:59:48,590 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:59:48,591 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:59:49,018 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:59:49,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:59:49 BoogieIcfgContainer [2018-02-04 01:59:49,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:59:49,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:59:49,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:59:49,024 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:59:49,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:59:48" (1/3) ... [2018-02-04 01:59:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eaf444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:59:49, skipping insertion in model container [2018-02-04 01:59:49,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:59:48" (2/3) ... [2018-02-04 01:59:49,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77eaf444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:59:49, skipping insertion in model container [2018-02-04 01:59:49,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:59:49" (3/3) ... [2018-02-04 01:59:49,027 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0137_false-valid-deref.i [2018-02-04 01:59:49,035 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:59:49,041 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-02-04 01:59:49,073 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:59:49,073 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:59:49,074 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:59:49,074 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:59:49,074 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:59:49,074 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:59:49,074 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:59:49,074 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:59:49,075 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:59:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-02-04 01:59:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 01:59:49,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:49,098 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 01:59:49,099 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:49,103 INFO L82 PathProgramCache]: Analyzing trace with hash 8574872, now seen corresponding path program 1 times [2018-02-04 01:59:49,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:49,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:49,235 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-04 01:59:49,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:49,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:59:49,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:49,239 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-04 01:59:49,240 INFO L182 omatonBuilderFactory]: Interpolants [192#false, 193#(= 1 (select |#valid| |~#gl_list.base|)), 191#true] [2018-02-04 01:59:49,240 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-04 01:59:49,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:59:49,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:59:49,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:59:49,256 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 3 states. [2018-02-04 01:59:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:49,490 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-04 01:59:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:59:49,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 01:59:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:49,500 INFO L225 Difference]: With dead ends: 189 [2018-02-04 01:59:49,500 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 01:59:49,502 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-04 01:59:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 01:59:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-02-04 01:59:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 01:59:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-04 01:59:49,538 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 4 [2018-02-04 01:59:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:49,538 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-04 01:59:49,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:59:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-04 01:59:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 01:59:49,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:49,539 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 01:59:49,539 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:49,539 INFO L82 PathProgramCache]: Analyzing trace with hash 8574873, now seen corresponding path program 1 times [2018-02-04 01:59:49,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:49,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:49,599 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-04 01:59:49,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:49,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:59:49,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:49,600 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-04 01:59:49,600 INFO L182 omatonBuilderFactory]: Interpolants [568#true, 569#false, 570#(and (= (select |#length| |~#gl_list.base|) 8) (= |~#gl_list.offset| 0))] [2018-02-04 01:59:49,600 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-04 01:59:49,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:59:49,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:59:49,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:59:49,602 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 3 states. [2018-02-04 01:59:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:49,712 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2018-02-04 01:59:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:59:49,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 01:59:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:49,714 INFO L225 Difference]: With dead ends: 187 [2018-02-04 01:59:49,714 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 01:59:49,715 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-04 01:59:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 01:59:49,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-04 01:59:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 01:59:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2018-02-04 01:59:49,726 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 4 [2018-02-04 01:59:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:49,726 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2018-02-04 01:59:49,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:59:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2018-02-04 01:59:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:59:49,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:49,727 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:59:49,727 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065266, now seen corresponding path program 1 times [2018-02-04 01:59:49,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:49,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:49,777 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-04 01:59:49,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:49,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:59:49,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:49,778 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-04 01:59:49,779 INFO L182 omatonBuilderFactory]: Interpolants [944#(= 1 (select |#valid| gl_insert_~node~0.base)), 941#true, 942#false, 943#(= 1 (select |#valid| |gl_insert_#t~malloc10.base|))] [2018-02-04 01:59:49,779 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-04 01:59:49,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:59:49,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:59:49,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:59:49,779 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand 4 states. [2018-02-04 01:59:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:49,896 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-02-04 01:59:49,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:59:49,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 01:59:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:49,899 INFO L225 Difference]: With dead ends: 182 [2018-02-04 01:59:49,899 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 01:59:49,900 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-04 01:59:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 01:59:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 01:59:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 01:59:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-02-04 01:59:49,908 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 16 [2018-02-04 01:59:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:49,909 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-02-04 01:59:49,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:59:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-02-04 01:59:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 01:59:49,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:49,910 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:59:49,910 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1609065267, now seen corresponding path program 1 times [2018-02-04 01:59:49,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:49,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:49,971 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-04 01:59:49,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:49,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:59:49,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:49,972 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-04 01:59:49,972 INFO L182 omatonBuilderFactory]: Interpolants [1312#false, 1313#(and (= 0 |gl_insert_#t~malloc10.offset|) (= 12 (select |#length| |gl_insert_#t~malloc10.base|))), 1314#(and (= (select |#length| gl_insert_~node~0.base) 12) (= 0 gl_insert_~node~0.offset)), 1311#true] [2018-02-04 01:59:49,973 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-04 01:59:49,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:59:49,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:59:49,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:59:49,973 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 4 states. [2018-02-04 01:59:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:50,085 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-02-04 01:59:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:59:50,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 01:59:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:50,086 INFO L225 Difference]: With dead ends: 181 [2018-02-04 01:59:50,086 INFO L226 Difference]: Without dead ends: 181 [2018-02-04 01:59:50,086 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-04 01:59:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-04 01:59:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-04 01:59:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 01:59:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2018-02-04 01:59:50,091 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 16 [2018-02-04 01:59:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:50,092 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2018-02-04 01:59:50,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:59:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2018-02-04 01:59:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:59:50,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:50,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-04 01:59:50,092 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:50,092 INFO L82 PathProgramCache]: Analyzing trace with hash -466429743, now seen corresponding path program 1 times [2018-02-04 01:59:50,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:50,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:50,182 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-04 01:59:50,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:50,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:59:50,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:50,183 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-04 01:59:50,183 INFO L182 omatonBuilderFactory]: Interpolants [1680#false, 1681#(= 1 (select |#valid| |~#gl_list.base|)), 1682#(or (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| |gl_insert_#t~malloc10.base|)), 1683#(or (= 1 (select |#valid| |~#gl_list.base|)) (= gl_insert_~node~0.base |~#gl_list.base|)), 1684#(= 1 (select |#valid| |list_add_#in~head.base|)), 1685#(= 1 (select |#valid| list_add_~head.base)), 1679#true] [2018-02-04 01:59:50,183 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-04 01:59:50,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:59:50,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:59:50,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:59:50,184 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand 7 states. [2018-02-04 01:59:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:50,392 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-02-04 01:59:50,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:59:50,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 01:59:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:50,393 INFO L225 Difference]: With dead ends: 189 [2018-02-04 01:59:50,393 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 01:59:50,394 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-04 01:59:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 01:59:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-02-04 01:59:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 01:59:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-02-04 01:59:50,400 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 19 [2018-02-04 01:59:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:50,401 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-02-04 01:59:50,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:59:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-02-04 01:59:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:59:50,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:50,401 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-04 01:59:50,401 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash -466429742, now seen corresponding path program 1 times [2018-02-04 01:59:50,402 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:50,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:50,484 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-04 01:59:50,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:50,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:59:50,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:50,485 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-04 01:59:50,485 INFO L182 omatonBuilderFactory]: Interpolants [2068#true, 2069#false, 2070#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 2071#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 2072#(and (not (= |~#gl_list.base| |gl_insert_#t~malloc10.base|)) (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 2073#(and (= 0 |list_add_#in~head.offset|) (= 8 (select |#length| |list_add_#in~head.base|))), 2074#(and (= (select |#length| list_add_~head.base) 8) (= list_add_~head.offset 0))] [2018-02-04 01:59:50,485 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-04 01:59:50,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:59:50,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:59:50,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:59:50,486 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 7 states. [2018-02-04 01:59:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:50,796 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-04 01:59:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:59:50,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 01:59:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:50,797 INFO L225 Difference]: With dead ends: 182 [2018-02-04 01:59:50,797 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 01:59:50,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:59:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 01:59:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 01:59:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 01:59:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-02-04 01:59:50,803 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 19 [2018-02-04 01:59:50,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:50,804 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-02-04 01:59:50,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:59:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-02-04 01:59:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:59:50,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:50,804 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-04 01:59:50,805 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060692, now seen corresponding path program 1 times [2018-02-04 01:59:50,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:50,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:50,902 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-04 01:59:50,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:50,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:59:50,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:50,903 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-04 01:59:50,903 INFO L182 omatonBuilderFactory]: Interpolants [2448#(and (not (= |~#gl_list.base| |gl_insert_#t~malloc10.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2449#(and (not (= |~#gl_list.base| gl_insert_~node~0.base)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2450#(= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 2451#(= list_add_~head.base (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)), 2452#(= 1 (select |#valid| |list_add_#t~mem7.base|)), 2453#(= 1 (select |#valid| |__list_add_#in~next.base|)), 2454#(= 1 (select |#valid| __list_add_~next.base)), 2445#true, 2446#false, 2447#(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|)))] [2018-02-04 01:59:50,904 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-04 01:59:50,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:59:50,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:59:50,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:59:50,904 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 10 states. [2018-02-04 01:59:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:51,184 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2018-02-04 01:59:51,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:59:51,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 01:59:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:51,185 INFO L225 Difference]: With dead ends: 208 [2018-02-04 01:59:51,185 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 01:59:51,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:59:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 01:59:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-02-04 01:59:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 01:59:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2018-02-04 01:59:51,189 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 22 [2018-02-04 01:59:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:51,189 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-02-04 01:59:51,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:59:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2018-02-04 01:59:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:59:51,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:51,190 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-04 01:59:51,190 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1189060691, now seen corresponding path program 1 times [2018-02-04 01:59:51,191 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:51,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:51,341 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-04 01:59:51,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:51,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:59:51,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:51,341 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-04 01:59:51,341 INFO L182 omatonBuilderFactory]: Interpolants [2880#false, 2881#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 2882#(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|))), 2883#(and (not (= |~#gl_list.base| |gl_insert_#t~malloc10.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= 8 (select |#length| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 2884#(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|))), 2885#(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|))), 2886#(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))), 2887#(and (= 8 (select |#length| list_add_~head.base)) (= list_add_~head.base |list_add_#t~mem7.base|) (= 0 |list_add_#t~mem7.offset|)), 2888#(and (= 8 (select |#length| |__list_add_#in~next.base|)) (= 0 |__list_add_#in~next.offset|)), 2889#(and (= __list_add_~next.offset 0) (= 8 (select |#length| __list_add_~next.base))), 2879#true] [2018-02-04 01:59:51,341 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-04 01:59:51,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:59:51,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:59:51,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:59:51,342 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. Second operand 11 states. [2018-02-04 01:59:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:52,099 INFO L93 Difference]: Finished difference Result 372 states and 392 transitions. [2018-02-04 01:59:52,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:59:52,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 01:59:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:52,102 INFO L225 Difference]: With dead ends: 372 [2018-02-04 01:59:52,102 INFO L226 Difference]: Without dead ends: 372 [2018-02-04 01:59:52,103 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-04 01:59:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-04 01:59:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 296. [2018-02-04 01:59:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 01:59:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 362 transitions. [2018-02-04 01:59:52,113 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 362 transitions. Word has length 22 [2018-02-04 01:59:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:52,113 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 362 transitions. [2018-02-04 01:59:52,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:59:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 362 transitions. [2018-02-04 01:59:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:59:52,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:52,114 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-04 01:59:52,114 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:52,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824186, now seen corresponding path program 1 times [2018-02-04 01:59:52,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:52,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:52,159 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-04 01:59:52,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:52,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:59:52,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:52,160 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-04 01:59:52,160 INFO L182 omatonBuilderFactory]: Interpolants [3584#(= 1 (select |#valid| __list_add_~new.base)), 3578#true, 3579#false, 3580#(= 1 (select |#valid| gl_insert_~node~0.base)), 3581#(= 1 (select |#valid| |list_add_#in~new.base|)), 3582#(= 1 (select |#valid| list_add_~new.base)), 3583#(= 1 (select |#valid| |__list_add_#in~new.base|))] [2018-02-04 01:59:52,160 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-04 01:59:52,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:59:52,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:59:52,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:59:52,161 INFO L87 Difference]: Start difference. First operand 296 states and 362 transitions. Second operand 7 states. [2018-02-04 01:59:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:52,369 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2018-02-04 01:59:52,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:59:52,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 01:59:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:52,370 INFO L225 Difference]: With dead ends: 308 [2018-02-04 01:59:52,370 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 01:59:52,371 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-04 01:59:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 01:59:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 211. [2018-02-04 01:59:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 01:59:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 230 transitions. [2018-02-04 01:59:52,376 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 230 transitions. Word has length 23 [2018-02-04 01:59:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:52,377 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 230 transitions. [2018-02-04 01:59:52,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:59:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 230 transitions. [2018-02-04 01:59:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:59:52,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:52,377 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-04 01:59:52,378 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1793824187, now seen corresponding path program 1 times [2018-02-04 01:59:52,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:52,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:52,452 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-04 01:59:52,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:52,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:59:52,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:52,453 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-04 01:59:52,453 INFO L182 omatonBuilderFactory]: Interpolants [4112#(and (<= 4 |list_add_#in~new.offset|) (= 12 (select |#length| |list_add_#in~new.base|)) (<= |list_add_#in~new.offset| 4)), 4113#(and (<= 4 list_add_~new.offset) (<= list_add_~new.offset 4) (= 12 (select |#length| list_add_~new.base))), 4114#(and (= 12 (select |#length| |__list_add_#in~new.base|)) (<= 4 |__list_add_#in~new.offset|) (<= |__list_add_#in~new.offset| 4)), 4115#(and (= (select |#length| __list_add_~new.base) 12) (<= __list_add_~new.offset 4) (<= 4 __list_add_~new.offset)), 4108#true, 4109#false, 4110#(and (= 0 |gl_insert_#t~malloc10.offset|) (= 12 (select |#length| |gl_insert_#t~malloc10.base|))), 4111#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset))] [2018-02-04 01:59:52,453 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-04 01:59:52,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:59:52,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:59:52,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:59:52,453 INFO L87 Difference]: Start difference. First operand 211 states and 230 transitions. Second operand 8 states. [2018-02-04 01:59:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:52,653 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2018-02-04 01:59:52,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:59:52,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 01:59:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:52,654 INFO L225 Difference]: With dead ends: 215 [2018-02-04 01:59:52,654 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 01:59:52,655 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-04 01:59:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 01:59:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-02-04 01:59:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 01:59:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2018-02-04 01:59:52,659 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 23 [2018-02-04 01:59:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:52,659 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2018-02-04 01:59:52,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:59:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2018-02-04 01:59:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:59:52,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:52,661 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-04 01:59:52,662 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156317, now seen corresponding path program 1 times [2018-02-04 01:59:52,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:52,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:52,690 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-04 01:59:52,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:52,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:59:52,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:52,691 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-04 01:59:52,691 INFO L182 omatonBuilderFactory]: Interpolants [4548#true, 4549#false, 4550#(= 1 (select |#valid| list_add_~head.base)), 4551#(= 1 (select |#valid| |__list_add_#in~prev.base|)), 4552#(= 1 (select |#valid| __list_add_~prev.base))] [2018-02-04 01:59:52,691 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-04 01:59:52,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:59:52,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:59:52,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:59:52,692 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 5 states. [2018-02-04 01:59:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:52,806 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-04 01:59:52,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:59:52,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 01:59:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:52,808 INFO L225 Difference]: With dead ends: 210 [2018-02-04 01:59:52,808 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 01:59:52,808 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-04 01:59:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 01:59:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-04 01:59:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 01:59:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-04 01:59:52,813 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 25 [2018-02-04 01:59:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:52,814 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-04 01:59:52,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:59:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-04 01:59:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:59:52,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:52,814 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-04 01:59:52,815 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:52,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1583156318, now seen corresponding path program 1 times [2018-02-04 01:59:52,815 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:52,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:52,890 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-04 01:59:52,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:52,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:59:52,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:52,891 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-04 01:59:52,891 INFO L182 omatonBuilderFactory]: Interpolants [4976#false, 4977#(= 0 |~#gl_list.offset|), 4978#(= 0 |list_add_#in~head.offset|), 4979#(= 0 list_add_~head.offset), 4980#(and (= 0 list_add_~head.offset) (<= (+ list_add_~head.offset 4) (select |#length| list_add_~head.base))), 4981#(and (= 0 |__list_add_#in~prev.offset|) (<= 4 (select |#length| |__list_add_#in~prev.base|))), 4982#(and (= __list_add_~prev.offset 0) (<= 4 (select |#length| __list_add_~prev.base))), 4975#true] [2018-02-04 01:59:52,891 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-04 01:59:52,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:59:52,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:59:52,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:59:52,892 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 8 states. [2018-02-04 01:59:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:53,040 INFO L93 Difference]: Finished difference Result 212 states and 221 transitions. [2018-02-04 01:59:53,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:59:53,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 01:59:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:53,041 INFO L225 Difference]: With dead ends: 212 [2018-02-04 01:59:53,041 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 01:59:53,041 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-04 01:59:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 01:59:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-02-04 01:59:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 01:59:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-02-04 01:59:53,044 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 25 [2018-02-04 01:59:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:53,044 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-02-04 01:59:53,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:59:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-02-04 01:59:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:59:53,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:53,045 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-04 01:59:53,045 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783090, now seen corresponding path program 1 times [2018-02-04 01:59:53,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:53,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:53,091 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-04 01:59:53,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:53,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:59:53,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:53,091 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-04 01:59:53,092 INFO L182 omatonBuilderFactory]: Interpolants [5415#true, 5416#false, 5417#(= list_add_~head.base |list_add_#in~head.base|), 5418#(= __list_add_~prev.base |__list_add_#in~prev.base|), 5419#(= 1 (select |#valid| |__list_add_#in~prev.base|)), 5420#(= 1 (select |#valid| |list_add_#in~head.base|)), 5421#(= 1 (select |#valid| |~#gl_list.base|)), 5422#(= 1 (select |#valid| |list_empty_#in~head.base|)), 5423#(= 1 (select |#valid| list_empty_~head.base))] [2018-02-04 01:59:53,092 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-04 01:59:53,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:59:53,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:59:53,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:59:53,092 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 9 states. [2018-02-04 01:59:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:53,373 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-02-04 01:59:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:59:53,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 01:59:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:53,374 INFO L225 Difference]: With dead ends: 209 [2018-02-04 01:59:53,374 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 01:59:53,375 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-04 01:59:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 01:59:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-04 01:59:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 01:59:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 220 transitions. [2018-02-04 01:59:53,377 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 220 transitions. Word has length 41 [2018-02-04 01:59:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:53,378 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 220 transitions. [2018-02-04 01:59:53,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:59:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 220 transitions. [2018-02-04 01:59:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:59:53,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:53,378 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-04 01:59:53,378 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1201783091, now seen corresponding path program 1 times [2018-02-04 01:59:53,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:53,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:53,476 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-04 01:59:53,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:53,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:59:53,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:53,477 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-04 01:59:53,477 INFO L182 omatonBuilderFactory]: Interpolants [5856#true, 5857#false, 5858#(= 0 |~#gl_list.offset|), 5859#(and (= list_add_~head.base |list_add_#in~head.base|) (= |list_add_#in~head.offset| list_add_~head.offset)), 5860#(and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~prev.offset 0)) (or (= __list_add_~prev.base |__list_add_#in~prev.base|) (not (= __list_add_~prev.offset 0)))), 5861#(or (<= 4 (select |#length| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~prev.offset| 0))), 5862#(or (<= 4 (select |#length| |list_add_#in~head.base|)) (not (= |list_add_#in~head.offset| 0))), 5863#(or (<= 4 (select |#length| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0))), 5864#(and (= 0 |~#gl_list.offset|) (<= 4 (select |#length| |~#gl_list.base|))), 5865#(and (<= 4 (select |#length| |list_empty_#in~head.base|)) (= 0 |list_empty_#in~head.offset|)), 5866#(and (= list_empty_~head.offset 0) (<= 4 (select |#length| list_empty_~head.base)))] [2018-02-04 01:59:53,477 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-04 01:59:53,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:59:53,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:59:53,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:59:53,478 INFO L87 Difference]: Start difference. First operand 209 states and 220 transitions. Second operand 11 states. [2018-02-04 01:59:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:53,823 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-02-04 01:59:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:59:53,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 01:59:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:53,824 INFO L225 Difference]: With dead ends: 208 [2018-02-04 01:59:53,824 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 01:59:53,824 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-04 01:59:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 01:59:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 01:59:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 01:59:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 219 transitions. [2018-02-04 01:59:53,828 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 219 transitions. Word has length 41 [2018-02-04 01:59:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:53,829 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 219 transitions. [2018-02-04 01:59:53,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:59:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 219 transitions. [2018-02-04 01:59:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 01:59:53,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:53,830 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-04 01:59:53,830 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 856902849, now seen corresponding path program 1 times [2018-02-04 01:59:53,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:53,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:54,078 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-04 01:59:54,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:59:54,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 01:59:54,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:54,079 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-04 01:59:54,079 INFO L182 omatonBuilderFactory]: Interpolants [6304#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 6305#(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|))), 6306#(and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 6307#(and (not (= |~#gl_list.base| |gl_insert_#t~malloc10.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= |gl_insert_#t~malloc10.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 6308#(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|)))), 6309#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 6310#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 6311#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))), 6312#(= 1 (select |#valid| |list_add_#t~mem7.base|)), 6313#(= 1 (select |#valid| |__list_add_#in~next.base|)), 6314#(= 1 (select |#valid| __list_add_~next.base)), 6297#true, 6298#false, 6299#(= 1 (select |#valid| |gl_insert_#t~malloc10.base|)), 6300#(= 1 (select |#valid| gl_insert_~node~0.base)), 6301#(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)), 6302#(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)), 6303#(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|))] [2018-02-04 01:59:54,079 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-04 01:59:54,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:59:54,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:59:54,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:59:54,080 INFO L87 Difference]: Start difference. First operand 208 states and 219 transitions. Second operand 18 states. [2018-02-04 01:59:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:54,717 INFO L93 Difference]: Finished difference Result 294 states and 310 transitions. [2018-02-04 01:59:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 01:59:54,717 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 01:59:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:54,718 INFO L225 Difference]: With dead ends: 294 [2018-02-04 01:59:54,718 INFO L226 Difference]: Without dead ends: 294 [2018-02-04 01:59:54,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-02-04 01:59:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-04 01:59:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 244. [2018-02-04 01:59:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 01:59:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 265 transitions. [2018-02-04 01:59:54,724 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 265 transitions. Word has length 48 [2018-02-04 01:59:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:54,724 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 265 transitions. [2018-02-04 01:59:54,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:59:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 265 transitions. [2018-02-04 01:59:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 01:59:54,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:54,725 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-04 01:59:54,726 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:54,726 INFO L82 PathProgramCache]: Analyzing trace with hash 856902850, now seen corresponding path program 1 times [2018-02-04 01:59:54,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:54,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:55,006 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-04 01:59:55,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:59:55,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 01:59:55,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:55,007 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-04 01:59:55,007 INFO L182 omatonBuilderFactory]: Interpolants [6880#false, 6881#(and (= 0 |gl_insert_#t~malloc10.offset|) (= 12 (select |#length| |gl_insert_#t~malloc10.base|))), 6882#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 6883#(and (= gl_insert_~node~0.offset 0) (= (select |#valid| gl_insert_~node~0.base) 1) (= 12 (select |#length| gl_insert_~node~0.base))), 6884#(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)), 6885#(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) (= (select |#valid| list_add_~head.base) 1)), 6886#(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|)), 6887#(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|)), 6888#(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|)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|)), 6889#(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) (<= (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|)))), 6890#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.base| |gl_insert_#t~malloc10.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|)))), 6891#(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|))), 6892#(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|)))), 6893#(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|))), 6894#(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))), 6895#(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|))), 6896#(and (<= |__list_add_#in~next.offset| 4) (= 12 (select |#length| |__list_add_#in~next.base|)) (<= 4 |__list_add_#in~next.offset|)), 6897#(and (= (select |#length| __list_add_~next.base) 12) (<= __list_add_~next.offset 4) (<= 4 __list_add_~next.offset)), 6879#true] [2018-02-04 01:59:55,007 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-04 01:59:55,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 01:59:55,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 01:59:55,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:59:55,008 INFO L87 Difference]: Start difference. First operand 244 states and 265 transitions. Second operand 19 states. [2018-02-04 01:59:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:55,883 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2018-02-04 01:59:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 01:59:55,883 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-04 01:59:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:55,888 INFO L225 Difference]: With dead ends: 256 [2018-02-04 01:59:55,888 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 01:59:55,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 01:59:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 01:59:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 194. [2018-02-04 01:59:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 01:59:55,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 203 transitions. [2018-02-04 01:59:55,894 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 203 transitions. Word has length 48 [2018-02-04 01:59:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:55,894 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 203 transitions. [2018-02-04 01:59:55,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 01:59:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 203 transitions. [2018-02-04 01:59:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 01:59:55,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:55,895 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-04 01:59:55,895 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377315, now seen corresponding path program 1 times [2018-02-04 01:59:55,896 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:55,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:55,952 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-04 01:59:55,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:55,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:59:55,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:55,953 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-04 01:59:55,953 INFO L182 omatonBuilderFactory]: Interpolants [7378#true, 7379#false, 7380#(= 1 (select |#valid| |gl_sort_~#dst~0.base|))] [2018-02-04 01:59:55,953 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-04 01:59:55,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:59:55,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:59:55,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:59:55,957 INFO L87 Difference]: Start difference. First operand 194 states and 203 transitions. Second operand 3 states. [2018-02-04 01:59:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:56,065 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-02-04 01:59:56,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:59:56,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 01:59:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:56,066 INFO L225 Difference]: With dead ends: 188 [2018-02-04 01:59:56,066 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 01:59:56,067 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-04 01:59:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 01:59:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 01:59:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 01:59:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 197 transitions. [2018-02-04 01:59:56,070 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 197 transitions. Word has length 48 [2018-02-04 01:59:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:56,070 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 197 transitions. [2018-02-04 01:59:56,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:59:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 197 transitions. [2018-02-04 01:59:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 01:59:56,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:56,071 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-04 01:59:56,071 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1348377314, now seen corresponding path program 1 times [2018-02-04 01:59:56,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:56,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:56,114 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-04 01:59:56,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:56,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 01:59:56,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:56,115 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-04 01:59:56,115 INFO L182 omatonBuilderFactory]: Interpolants [7757#true, 7758#false, 7759#(and (= (select |#length| |gl_sort_~#dst~0.base|) 8) (= |gl_sort_~#dst~0.offset| 0))] [2018-02-04 01:59:56,115 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-04 01:59:56,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 01:59:56,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 01:59:56,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 01:59:56,116 INFO L87 Difference]: Start difference. First operand 188 states and 197 transitions. Second operand 3 states. [2018-02-04 01:59:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:56,170 INFO L93 Difference]: Finished difference Result 182 states and 191 transitions. [2018-02-04 01:59:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 01:59:56,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 01:59:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:56,171 INFO L225 Difference]: With dead ends: 182 [2018-02-04 01:59:56,171 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 01:59:56,172 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-04 01:59:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 01:59:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-04 01:59:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-04 01:59:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-02-04 01:59:56,175 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 48 [2018-02-04 01:59:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:56,175 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-02-04 01:59:56,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 01:59:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-02-04 01:59:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 01:59:56,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:59:56,176 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765471, now seen corresponding path program 1 times [2018-02-04 01:59:56,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:56,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:56,270 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-04 01:59:56,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:56,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:59:56,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:56,271 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-04 01:59:56,271 INFO L182 omatonBuilderFactory]: Interpolants [8128#(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|)), 8129#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 8130#(= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 8131#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 8132#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 8133#(= 1 (select |#valid| |gl_destroy_#t~mem14.base|)), 8134#(= 1 (select |#valid| gl_destroy_~next~0.base)), 8124#true, 8125#false, 8126#(= 1 (select |#valid| gl_insert_~node~0.base)), 8127#(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))] [2018-02-04 01:59:56,271 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-04 01:59:56,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:59:56,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:59:56,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:59:56,272 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 11 states. [2018-02-04 01:59:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:56,920 INFO L93 Difference]: Finished difference Result 266 states and 283 transitions. [2018-02-04 01:59:56,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 01:59:56,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-04 01:59:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:56,922 INFO L225 Difference]: With dead ends: 266 [2018-02-04 01:59:56,922 INFO L226 Difference]: Without dead ends: 266 [2018-02-04 01:59:56,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:59:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-04 01:59:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 188. [2018-02-04 01:59:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 01:59:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-02-04 01:59:56,927 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 55 [2018-02-04 01:59:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:56,927 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-02-04 01:59:56,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:59:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-02-04 01:59:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 01:59:56,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:56,928 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-04 01:59:56,928 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1058765472, now seen corresponding path program 1 times [2018-02-04 01:59:56,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:56,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:57,109 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-04 01:59:57,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:57,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 01:59:57,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:57,109 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-04 01:59:57,110 INFO L182 omatonBuilderFactory]: Interpolants [8610#true, 8611#false, 8612#(and (= 0 |gl_insert_#t~malloc10.offset|) (= 12 (select |#length| |gl_insert_#t~malloc10.base|))), 8613#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 8614#(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)), 8615#(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|)), 8616#(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|)), 8617#(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|))), 8618#(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|)))), 8619#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8620#(and (<= |gl_destroy_#t~mem14.offset| 4) (<= 4 |gl_destroy_#t~mem14.offset|) (= 12 (select |#length| |gl_destroy_#t~mem14.base|))), 8621#(and (<= gl_destroy_~next~0.offset 4) (<= 4 gl_destroy_~next~0.offset) (= (select |#length| gl_destroy_~next~0.base) 12))] [2018-02-04 01:59:57,110 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-04 01:59:57,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:59:57,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:59:57,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:59:57,110 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 12 states. [2018-02-04 01:59:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:57,784 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-02-04 01:59:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:59:57,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-04 01:59:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:57,785 INFO L225 Difference]: With dead ends: 210 [2018-02-04 01:59:57,785 INFO L226 Difference]: Without dead ends: 210 [2018-02-04 01:59:57,785 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-04 01:59:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-04 01:59:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 191. [2018-02-04 01:59:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 01:59:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2018-02-04 01:59:57,788 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 55 [2018-02-04 01:59:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:57,788 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2018-02-04 01:59:57,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:59:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2018-02-04 01:59:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 01:59:57,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:57,788 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-04 01:59:57,788 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:57,789 INFO L82 PathProgramCache]: Analyzing trace with hash -558928184, now seen corresponding path program 1 times [2018-02-04 01:59:57,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:57,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:57,937 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-04 01:59:57,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:59:57,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 01:59:57,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:57,937 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-04 01:59:57,938 INFO L182 omatonBuilderFactory]: Interpolants [9056#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 9057#(not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 9058#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9059#(= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |gl_destroy_#t~mem14.base|), 9060#(= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) gl_destroy_~next~0.base), 9061#(= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)), 9046#true, 9047#false, 9048#(= (select |#valid| |~#gl_list.base|) 1), 9049#(= |#valid| |old(#valid)|), 9050#(= 0 (select |old(#valid)| |gl_insert_#t~malloc10.base|)), 9051#(= 0 (select |old(#valid)| gl_insert_~node~0.base)), 9052#(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)), 9053#(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|)), 9054#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 9055#(= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))] [2018-02-04 01:59:57,938 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-04 01:59:57,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:59:57,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:59:57,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:59:57,938 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand 16 states. [2018-02-04 01:59:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:59:59,009 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-04 01:59:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 01:59:59,010 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-04 01:59:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:59:59,010 INFO L225 Difference]: With dead ends: 217 [2018-02-04 01:59:59,011 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 01:59:59,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 01:59:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 01:59:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 189. [2018-02-04 01:59:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 01:59:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2018-02-04 01:59:59,014 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 58 [2018-02-04 01:59:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:59:59,014 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2018-02-04 01:59:59,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:59:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2018-02-04 01:59:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 01:59:59,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:59:59,014 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-04 01:59:59,014 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 01:59:59,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1044324748, now seen corresponding path program 1 times [2018-02-04 01:59:59,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:59:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:59:59,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:59:59,262 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-04 01:59:59,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:59:59,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 01:59:59,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:59:59,263 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-04 01:59:59,263 INFO L182 omatonBuilderFactory]: Interpolants [9536#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9537#(and (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 9538#(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|)), 9539#(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|)), 9540#(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~ret24| 0)), 9541#(and (= |~#gl_list.offset| (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9542#(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|)))), 9543#(and (= 1 (select |#valid| |~#gl_list.base|)) (not (= 0 |gl_destroy_#t~mem14.base|)) (= |~#gl_list.offset| |gl_destroy_#t~mem14.offset|)), 9544#(and (= 1 (select |#valid| |~#gl_list.base|)) (not (= 0 gl_destroy_~next~0.base)) (= gl_destroy_~next~0.offset |~#gl_list.offset|)), 9545#(and (= 1 (select |#valid| |~#gl_list.base|)) (not (= 0 gl_destroy_~next~0.base)) (= (select (store |#valid| gl_destroy_~next~0.base 0) |~#gl_list.base|) (select |#valid| |~#gl_list.base|))), 9546#(= 1 (select |#valid| |~#gl_list.base|)), 9527#true, 9528#false, 9529#(not (= 0 |gl_insert_#t~malloc10.base|)), 9530#(not (= 0 gl_insert_~node~0.base)), 9531#(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)), 9532#(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|)), 9533#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 9534#(= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 9535#(not (= 0 (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))] [2018-02-04 01:59:59,263 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-04 01:59:59,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 01:59:59,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 01:59:59,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:59:59,264 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand 20 states. [2018-02-04 02:00:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:00,137 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-02-04 02:00:00,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:00:00,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-02-04 02:00:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:00,165 INFO L225 Difference]: With dead ends: 204 [2018-02-04 02:00:00,165 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 02:00:00,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 02:00:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 02:00:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2018-02-04 02:00:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 02:00:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 201 transitions. [2018-02-04 02:00:00,168 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 201 transitions. Word has length 60 [2018-02-04 02:00:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:00,168 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 201 transitions. [2018-02-04 02:00:00,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 02:00:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 201 transitions. [2018-02-04 02:00:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 02:00:00,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:00,169 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-04 02:00:00,169 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1264430060, now seen corresponding path program 1 times [2018-02-04 02:00:00,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:00,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:00,377 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-04 02:00:00,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:00,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 02:00:00,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:00,378 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-04 02:00:00,379 INFO L182 omatonBuilderFactory]: Interpolants [9999#true, 10000#false, 10001#(= 0 |~#gl_list.offset|), 10002#(= 0 |gl_insert_#t~malloc10.offset|), 10003#(= 0 gl_insert_~node~0.offset), 10004#(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)), 10005#(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))), 10006#(or (not (= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) 0)) (<= |__list_add_#in~new.offset| 0)), 10007#(or (not (= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0)) (<= |list_add_#in~new.offset| 0)), 10008#(not (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 0)), 10009#(not (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.offset|)), 10010#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10011#(and (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 10012#(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|)), 10013#(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|)), 10014#(or (= |~#gl_list.offset| (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|)) (= |gl_sort_#t~ret24| 0)), 10015#(= |~#gl_list.offset| (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|))] [2018-02-04 02:00:00,379 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-04 02:00:00,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:00:00,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:00:00,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:00:00,380 INFO L87 Difference]: Start difference. First operand 191 states and 201 transitions. Second operand 17 states. [2018-02-04 02:00:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:01,190 INFO L93 Difference]: Finished difference Result 189 states and 197 transitions. [2018-02-04 02:00:01,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 02:00:01,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-04 02:00:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:01,191 INFO L225 Difference]: With dead ends: 189 [2018-02-04 02:00:01,191 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 02:00:01,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:00:01,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 02:00:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2018-02-04 02:00:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 02:00:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 177 transitions. [2018-02-04 02:00:01,197 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 177 transitions. Word has length 63 [2018-02-04 02:00:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:01,197 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 177 transitions. [2018-02-04 02:00:01,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:00:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 177 transitions. [2018-02-04 02:00:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:00:01,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:01,197 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] [2018-02-04 02:00:01,197 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017735, now seen corresponding path program 1 times [2018-02-04 02:00:01,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:01,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:01,446 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-04 02:00:01,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:01,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 02:00:01,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:01,447 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-04 02:00:01,447 INFO L182 omatonBuilderFactory]: Interpolants [10432#(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|))), 10433#(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|))) (= 1 (select |#valid| |gl_sort_~#dst~0.base|))), 10434#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 10435#(= 1 (select |#valid| |gl_seek_max_#t~mem19.base|)), 10436#(= 1 (select |#valid| gl_seek_max_~max_pos~0.base)), 10437#(= 1 (select |#valid| |val_from_node_#in~head.base|)), 10438#(= 1 (select |#valid| val_from_node_~entry~0.base)), 10421#true, 10422#false, 10423#(= 1 (select |#valid| |gl_insert_#t~malloc10.base|)), 10424#(= 1 (select |#valid| gl_insert_~node~0.base)), 10425#(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)), 10426#(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)), 10427#(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|)), 10428#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 10429#(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|))), 10430#(and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 10431#(= list_empty_~head.base |list_empty_#in~head.base|)] [2018-02-04 02:00:01,447 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-04 02:00:01,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 02:00:01,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 02:00:01,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:00:01,448 INFO L87 Difference]: Start difference. First operand 171 states and 177 transitions. Second operand 18 states. [2018-02-04 02:00:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:02,217 INFO L93 Difference]: Finished difference Result 266 states and 284 transitions. [2018-02-04 02:00:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:00:02,218 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-02-04 02:00:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:02,219 INFO L225 Difference]: With dead ends: 266 [2018-02-04 02:00:02,219 INFO L226 Difference]: Without dead ends: 266 [2018-02-04 02:00:02,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:00:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-04 02:00:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2018-02-04 02:00:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 02:00:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2018-02-04 02:00:02,222 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 66 [2018-02-04 02:00:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:02,222 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-02-04 02:00:02,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 02:00:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2018-02-04 02:00:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:00:02,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:02,222 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] [2018-02-04 02:00:02,223 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:02,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1010017736, now seen corresponding path program 1 times [2018-02-04 02:00:02,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:02,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:02,584 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-04 02:00:02,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:02,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 02:00:02,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:02,585 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-04 02:00:02,585 INFO L182 omatonBuilderFactory]: Interpolants [10944#(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) (= (select |#valid| |list_add_#in~head.base|) 1)), 10945#(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|)), 10946#(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|)), 10947#(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|)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|)), 10948#(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) (<= (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|)))), 10949#(= list_empty_~head.base |list_empty_#in~head.base|), 10950#(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|))), 10951#(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|)))), 10952#(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|)))), 10953#(and (= 12 (select |#length| |gl_seek_max_#t~mem19.base|)) (<= |gl_seek_max_#t~mem19.offset| 4) (<= 4 |gl_seek_max_#t~mem19.offset|)), 10954#(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))), 10955#(and (<= |val_from_node_#in~head.offset| 4) (= 12 (select |#length| |val_from_node_#in~head.base|)) (<= 4 |val_from_node_#in~head.offset|)), 10956#(and (= (select |#length| val_from_node_~entry~0.base) 12) (<= 0 val_from_node_~entry~0.offset) (<= val_from_node_~entry~0.offset 0)), 10938#true, 10939#false, 10940#(and (= 0 |gl_insert_#t~malloc10.offset|) (= 12 (select |#length| |gl_insert_#t~malloc10.base|))), 10941#(and (= 12 (select |#length| gl_insert_~node~0.base)) (= 0 gl_insert_~node~0.offset)), 10942#(and (= gl_insert_~node~0.offset 0) (= (select |#valid| gl_insert_~node~0.base) 1) (= 12 (select |#length| gl_insert_~node~0.base))), 10943#(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))] [2018-02-04 02:00:02,585 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-04 02:00:02,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:00:02,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:00:02,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:00:02,586 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand 19 states. [2018-02-04 02:00:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:03,510 INFO L93 Difference]: Finished difference Result 250 states and 266 transitions. [2018-02-04 02:00:03,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 02:00:03,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-02-04 02:00:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:03,511 INFO L225 Difference]: With dead ends: 250 [2018-02-04 02:00:03,511 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 02:00:03,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:00:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 02:00:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 208. [2018-02-04 02:00:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 02:00:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions. [2018-02-04 02:00:03,516 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 66 [2018-02-04 02:00:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:03,516 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions. [2018-02-04 02:00:03,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:00:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2018-02-04 02:00:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:00:03,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:03,517 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-04 02:00:03,517 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017030, now seen corresponding path program 1 times [2018-02-04 02:00:03,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:03,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:03,572 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-04 02:00:03,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:03,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:00:03,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:03,573 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-04 02:00:03,573 INFO L182 omatonBuilderFactory]: Interpolants [11442#true, 11443#false, 11444#(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|)) (= 1 (select |#valid| |gl_sort_~#dst~0.base|))), 11445#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))), 11446#(= 1 (select |#valid| |gl_sort_#t~mem26.base|))] [2018-02-04 02:00:03,573 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-04 02:00:03,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:00:03,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:00:03,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:00:03,574 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 5 states. [2018-02-04 02:00:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:03,664 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-02-04 02:00:03,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:00:03,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 02:00:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:03,665 INFO L225 Difference]: With dead ends: 214 [2018-02-04 02:00:03,665 INFO L226 Difference]: Without dead ends: 214 [2018-02-04 02:00:03,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:00:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-04 02:00:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-02-04 02:00:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 02:00:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2018-02-04 02:00:03,668 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 67 [2018-02-04 02:00:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:03,668 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2018-02-04 02:00:03,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:00:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2018-02-04 02:00:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:00:03,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:03,668 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-04 02:00:03,668 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:03,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1387017031, now seen corresponding path program 1 times [2018-02-04 02:00:03,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:03,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:03,742 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-04 02:00:03,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:03,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:00:03,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:03,743 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-04 02:00:03,743 INFO L182 omatonBuilderFactory]: Interpolants [11875#true, 11876#false, 11877#(and (= 0 |gl_sort_~#dst~0.offset|) (= 8 (select |#length| |gl_sort_~#dst~0.base|))), 11878#(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|))), 11879#(and (= |gl_sort_#t~mem26.offset| 0) (= (select |#length| |gl_sort_#t~mem26.base|) 8))] [2018-02-04 02:00:03,743 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-04 02:00:03,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:00:03,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:00:03,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:00:03,743 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand 5 states. [2018-02-04 02:00:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:03,897 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-02-04 02:00:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:00:03,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 02:00:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:03,898 INFO L225 Difference]: With dead ends: 218 [2018-02-04 02:00:03,898 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 02:00:03,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:00:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 02:00:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2018-02-04 02:00:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 02:00:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 226 transitions. [2018-02-04 02:00:03,901 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 226 transitions. Word has length 67 [2018-02-04 02:00:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:03,902 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 226 transitions. [2018-02-04 02:00:03,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:00:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 226 transitions. [2018-02-04 02:00:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:00:03,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:03,902 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] [2018-02-04 02:00:03,903 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:03,903 INFO L82 PathProgramCache]: Analyzing trace with hash 48096554, now seen corresponding path program 1 times [2018-02-04 02:00:03,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:03,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:03,950 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-04 02:00:03,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:03,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:00:03,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:03,951 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-04 02:00:03,951 INFO L182 omatonBuilderFactory]: Interpolants [12314#true, 12315#false, 12316#(and (= 0 |gl_seek_max_#res.base|) (= 0 |gl_seek_max_#res.offset|)), 12317#(and (= 0 |gl_sort_#t~ret25.base|) (= 0 |gl_sort_#t~ret25.offset|)), 12318#(and (= 0 gl_sort_~max_pos~1.offset) (= 0 gl_sort_~max_pos~1.base))] [2018-02-04 02:00:03,951 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-04 02:00:03,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:00:03,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:00:03,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:00:03,952 INFO L87 Difference]: Start difference. First operand 212 states and 226 transitions. Second operand 5 states. [2018-02-04 02:00:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:03,967 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-02-04 02:00:03,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:00:03,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-04 02:00:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:03,968 INFO L225 Difference]: With dead ends: 220 [2018-02-04 02:00:03,968 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 02:00:03,968 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-04 02:00:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 02:00:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-04 02:00:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 02:00:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 234 transitions. [2018-02-04 02:00:03,972 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 234 transitions. Word has length 68 [2018-02-04 02:00:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:03,972 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 234 transitions. [2018-02-04 02:00:03,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:00:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 234 transitions. [2018-02-04 02:00:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 02:00:03,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:03,976 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] [2018-02-04 02:00:03,976 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:03,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988233, now seen corresponding path program 1 times [2018-02-04 02:00:03,977 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:03,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:00:04,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:04,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 02:00:04,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:04,226 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-04 02:00:04,226 INFO L182 omatonBuilderFactory]: Interpolants [12768#(and (= |gl_sort_~#dst~0.base| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= 1 (select |#valid| |~#gl_list.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4))))), 12769#(and (= |gl_sort_~#dst~0.base| |gl_sort_#t~mem26.base|) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| |gl_sort_#t~mem26.base|) (+ |gl_sort_#t~mem26.offset| 4) |~#gl_list.base|) (+ |gl_sort_~#dst~0.offset| 4))))), 12770#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4)))), 12771#(= 1 (select |#valid| |gl_sort_#t~mem28.base|)), 12761#true, 12762#false, 12763#(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|)) (= 1 (select |#valid| |gl_sort_~#dst~0.base|))), 12764#(and (= |gl_sort_~#dst~0.base| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4))))), 12765#(= list_empty_~head.base |list_empty_#in~head.base|), 12766#(= 1 (select |#valid| |list_empty_#in~head.base|)), 12767#(= 1 (select |#valid| |~#gl_list.base|))] [2018-02-04 02:00:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:00:04,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:00:04,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:00:04,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:00:04,227 INFO L87 Difference]: Start difference. First operand 220 states and 234 transitions. Second operand 11 states. [2018-02-04 02:00:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:04,564 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-04 02:00:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:00:04,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-02-04 02:00:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:04,565 INFO L225 Difference]: With dead ends: 229 [2018-02-04 02:00:04,565 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 02:00:04,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:00:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 02:00:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-04 02:00:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 02:00:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-04 02:00:04,568 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 70 [2018-02-04 02:00:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:04,568 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-04 02:00:04,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:00:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-04 02:00:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 02:00:04,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:04,569 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] [2018-02-04 02:00:04,569 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1255988232, now seen corresponding path program 1 times [2018-02-04 02:00:04,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:04,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:00:04,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:00:04,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 02:00:04,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:04,863 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-04 02:00:04,863 INFO L182 omatonBuilderFactory]: Interpolants [13248#(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|)), 13249#(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|)), 13250#(or (<= 4 (select |#length| |list_empty_#in~head.base|)) (not (= |list_empty_#in~head.offset| 0))), 13251#(or (<= 4 (select |#length| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0))), 13252#(and (= |gl_sort_~#dst~0.base| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= 0 |~#gl_list.offset|) (<= 4 (select |#length| |~#gl_list.base|)) (<= (+ |gl_sort_~#dst~0.offset| 8) (select |#length| |gl_sort_~#dst~0.base|)) (<= 0 |gl_sort_~#dst~0.offset|) (= (select |#length| |gl_sort_~#dst~0.base|) 8) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|))), 13253#(and (= 0 |~#gl_list.offset|) (<= 4 (select |#length| |~#gl_list.base|)) (= |gl_sort_~#dst~0.offset| |gl_sort_#t~mem26.offset|) (= |gl_sort_#t~mem26.offset| 0) (= |gl_sort_#t~mem26.base| |gl_sort_~#dst~0.base|)), 13254#(and (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) (+ |gl_sort_~#dst~0.offset| 4))))), 13255#(and (<= 4 (select |#length| |gl_sort_#t~mem28.base|)) (= |gl_sort_#t~mem28.offset| 0)), 13242#true, 13243#false, 13244#(= 0 |~#gl_list.offset|), 13245#(and (= 0 |gl_sort_~#dst~0.offset|) (= 0 |~#gl_list.offset|) (= (select |#length| |gl_sort_~#dst~0.base|) 8)), 13246#(and (= 0 |~#gl_list.offset|) (<= 0 |gl_sort_~#dst~0.offset|) (= |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 |#length| |gl_sort_~#dst~0.base|) 8) (= 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|))), 13247#(and (= |gl_sort_~#dst~0.base| (select (select |#memory_$Pointer$.base| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)) (= 0 |~#gl_list.offset|) (<= (+ |gl_sort_~#dst~0.offset| 8) (select |#length| |gl_sort_~#dst~0.base|)) (<= 0 |gl_sort_~#dst~0.offset|) (= (select |#length| |gl_sort_~#dst~0.base|) 8) (= 0 (select (select |#memory_$Pointer$.offset| |gl_sort_~#dst~0.base|) |gl_sort_~#dst~0.offset|)))] [2018-02-04 02:00:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:00:04,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:00:04,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:00:04,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:00:04,864 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 14 states. [2018-02-04 02:00:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:05,349 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-04 02:00:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:00:05,350 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-02-04 02:00:05,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:05,350 INFO L225 Difference]: With dead ends: 229 [2018-02-04 02:00:05,350 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 02:00:05,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-02-04 02:00:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 02:00:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2018-02-04 02:00:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 02:00:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 237 transitions. [2018-02-04 02:00:05,353 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 237 transitions. Word has length 70 [2018-02-04 02:00:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:05,353 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 237 transitions. [2018-02-04 02:00:05,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:00:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 237 transitions. [2018-02-04 02:00:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:00:05,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:05,354 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] [2018-02-04 02:00:05,354 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash 593824277, now seen corresponding path program 1 times [2018-02-04 02:00:05,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:00:05,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:00:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:00:06,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:00:06,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 02:00:06,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:00:06,049 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-04 02:00:06,049 INFO L182 omatonBuilderFactory]: Interpolants [13760#(= 1 (select |#valid| val_from_node_~entry~0.base)), 13727#true, 13728#false, 13729#(= 0 |~#gl_list.offset|), 13730#(and (= 1 (select |#valid| |~#gl_list.base|)) (= 0 |~#gl_list.offset|)), 13731#(= |#valid| |old(#valid)|), 13732#(= (select |old(#valid)| |gl_insert_#t~malloc10.base|) 0), 13733#(= (select |old(#valid)| gl_insert_~node~0.base) 0), 13734#(and (= (select |#valid| gl_insert_~node~0.base) 1) (= (select |old(#valid)| gl_insert_~node~0.base) 0)), 13735#(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)), 13736#(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)), 13737#(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|)), 13738#(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|)), 13739#(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|)), 13740#(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|)), 13741#(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|)))))), 13742#(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|)))), 13743#(and (= (select |#valid| |~#gl_list.base|) 1) (or (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|))))) (= (select |old(#valid)| |~#gl_list.base|) 0))), 13744#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 1) (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#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|))))), 13745#(and (= |list_empty_#in~head.offset| list_empty_~head.offset) (= list_empty_~head.base |list_empty_#in~head.base|)), 13746#(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|)), 13747#(and (or (= 0 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (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|)))))) (= (select |#valid| |~#gl_list.base|) 1)), 13748#(and (not (= |gl_sort_~#dst~0.base| |~#gl_list.base|)) (or (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|))))) (= 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|)) |~#gl_list.base|) |~#gl_list.offset|)))), 13749#(or (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|)) (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|)))) (= 1 (select |#valid| |gl_sort_~#dst~0.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|)) |~#gl_list.base|) |~#gl_list.offset|))), 13750#(or (= 0 (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|))))), 13751#(= list_empty_~head.base |list_empty_#in~head.base|), 13752#(or (= 0 |gl_seek_max_#t~mem19.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |gl_seek_max_#t~mem19.base|) |gl_seek_max_#t~mem19.offset|)))), 13753#(or (= gl_seek_max_~max_pos~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset)))), 13754#(<= (+ val_from_node_~entry~0.offset 4) |val_from_node_#in~head.offset|), 13755#(<= 4 |val_from_node_#in~head.offset|), 13756#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| gl_seek_max_~max_pos~0.base) gl_seek_max_~max_pos~0.offset))), 13757#(= 1 (select |#valid| |gl_seek_max_#t~mem21.base|)), 13758#(= 1 (select |#valid| gl_seek_max_~pos~0.base)), 13759#(= 1 (select |#valid| |val_from_node_#in~head.base|))] [2018-02-04 02:00:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:00:06,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:00:06,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:00:06,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1041, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:00:06,051 INFO L87 Difference]: Start difference. First operand 223 states and 237 transitions. Second operand 34 states. [2018-02-04 02:00:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:00:08,093 INFO L93 Difference]: Finished difference Result 290 states and 309 transitions. [2018-02-04 02:00:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 02:00:08,093 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 77 [2018-02-04 02:00:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:00:08,094 INFO L225 Difference]: With dead ends: 290 [2018-02-04 02:00:08,094 INFO L226 Difference]: Without dead ends: 290 [2018-02-04 02:00:08,095 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=4061, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 02:00:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-04 02:00:08,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 234. [2018-02-04 02:00:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 02:00:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 252 transitions. [2018-02-04 02:00:08,099 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 252 transitions. Word has length 77 [2018-02-04 02:00:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:00:08,100 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 252 transitions. [2018-02-04 02:00:08,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:00:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 252 transitions. [2018-02-04 02:00:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 02:00:08,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:00:08,100 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] [2018-02-04 02:00:08,101 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, gl_sortErr16RequiresViolation, gl_sortErr4RequiresViolation, gl_sortErr12RequiresViolation, gl_sortErr5RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr11RequiresViolation, gl_sortErr9RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr18RequiresViolation, gl_sortErr7RequiresViolation, gl_sortErr13RequiresViolation, gl_sortErr14RequiresViolation, gl_sortErr19RequiresViolation, gl_sortErr6RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr17RequiresViolation, gl_sortErr15RequiresViolation, gl_sortErr10RequiresViolation, gl_sortErr8RequiresViolation, gl_sortErr3RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, mainErr0EnsuresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-04 02:00:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 593824278, now seen corresponding path program 1 times [2018-02-04 02:00:08,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:00:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:00:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:00:08,188 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:00:08,211 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 02:00:08,212 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 02:00:08,212 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 02:00:08,213 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# [2018-02-04 02:00:08,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:00:08 BoogieIcfgContainer [2018-02-04 02:00:08,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:00:08,226 INFO L168 Benchmark]: Toolchain (without parser) took 19885.58 ms. Allocated memory was 403.7 MB in the beginning and 1.0 GB in the end (delta: 642.3 MB). Free memory was 360.4 MB in the beginning and 783.2 MB in the end (delta: -422.8 MB). Peak memory consumption was 219.4 MB. Max. memory is 5.3 GB. [2018-02-04 02:00:08,227 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:00:08,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.51 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 348.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-04 02:00:08,228 INFO L168 Benchmark]: Boogie Preprocessor took 32.30 ms. Allocated memory is still 403.7 MB. Free memory was 348.3 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:00:08,228 INFO L168 Benchmark]: RCFGBuilder took 470.24 ms. Allocated memory is still 403.7 MB. Free memory was 347.0 MB in the beginning and 300.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:00:08,228 INFO L168 Benchmark]: TraceAbstraction took 19204.89 ms. Allocated memory was 403.7 MB in the beginning and 1.0 GB in the end (delta: 642.3 MB). Free memory was 299.1 MB in the beginning and 783.2 MB in the end (delta: -484.1 MB). Peak memory consumption was 158.2 MB. Max. memory is 5.3 GB. [2018-02-04 02:00:08,229 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.15 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.51 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 348.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.30 ms. Allocated memory is still 403.7 MB. Free memory was 348.3 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 470.24 ms. Allocated memory is still 403.7 MB. Free memory was 347.0 MB in the beginning and 300.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19204.89 ms. Allocated memory was 403.7 MB in the beginning and 1.0 GB in the end (delta: 642.3 MB). Free memory was 299.1 MB in the beginning and 783.2 MB in the end (delta: -484.1 MB). Peak memory consumption was 158.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 29 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 17 could not be translated for associated CType STRUCT#?next~$Pointer$?prev~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: IVAL [\old(gl_list)=null, \old(gl_list)=null, gl_list={29:17}] [L660] FCALL struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={22:0}] [L721] CALL gl_read() VAL [gl_list={22:0}] [L672] CALL gl_insert(__VERIFIER_nondet_int()) VAL [\old(value)=0, gl_list={22:0}] [L663] EXPR, FCALL malloc(sizeof *node) VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, value=0] [L663] struct node *node = malloc(sizeof *node); VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L664] COND FALSE !(!node) VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L666] FCALL node->value = value VAL [\old(value)=0, gl_list={22:0}, malloc(sizeof *node)={20:0}, node={20:0}, value=0] [L667] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={22:0}, head={22:0}, new={20:4}] [L643] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={22:0}, new={20:4}, new={20:4}] [L643] CALL __list_add(new, head, head->next) VAL [gl_list={22:0}, new={20:4}, next={22:0}, prev={22:0}] [L631] FCALL next->prev = new VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L632] FCALL new->next = next VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L633] FCALL new->prev = prev VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L634] RET, FCALL prev->next = new VAL [gl_list={22:0}, new={20:4}, new={20:4}, next={22:0}, next={22:0}, prev={22:0}, prev={22:0}] [L643] __list_add(new, head, head->next) VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={22:0}, new={20:4}, new={20:4}] [L667] FCALL list_add(&node->linkage, &gl_list) VAL [__VERIFIER_nondet_int()=0, gl_list={22:0}] [L674] COND FALSE, RET !(__VERIFIER_nondet_int()) [L721] gl_read() VAL [gl_list={22:0}] [L722] CALL gl_sort() VAL [gl_list={22:0}] [L709] CALL list_empty(&gl_list) VAL [gl_list={22:0}, head={22:0}] [L625] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={20:4}] [L625] RET return head->next == head; [L709] list_empty(&gl_list) VAL [gl_list={22:0}, list_empty(&gl_list)=0] [L709] COND FALSE !(list_empty(&gl_list)) [L711] FCALL struct list_head dst = { &(dst), &(dst) }; VAL [dst={18:0}, gl_list={22:0}] [L712] struct list_head *max_pos; VAL [dst={18:0}, gl_list={22:0}] [L713] CALL gl_seek_max() VAL [gl_list={22:0}] [L690] struct list_head *pos, *max_pos = ((void *)0); [L691] int max; VAL [gl_list={22:0}, pos={0:0}] [L692] CALL list_empty(&gl_list) VAL [gl_list={22:0}, head={22:0}] [L625] EXPR, FCALL head->next VAL [gl_list={22:0}, head={22:0}, head={22:0}, head->next={20:4}] [L625] RET return head->next == head; [L692] list_empty(&gl_list) VAL [gl_list={22:0}, list_empty(&gl_list)=0, pos={0:0}] [L692] COND FALSE !(list_empty(&gl_list)) [L695] EXPR, FCALL gl_list.next VAL [gl_list={22:0}, gl_list.next={20:4}, pos={0:0}] [L695] max_pos = gl_list.next [L696] CALL, EXPR val_from_node(max_pos) VAL [gl_list={22:0}, head={20:4}] [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [entry={20:0}, gl_list={22:0}, head={20:4}, head={20:4}] [L686] EXPR, FCALL entry->value VAL [entry={20:0}, entry->value=0, gl_list={22:0}, head={20:4}, head={20:4}] [L686] RET return entry->value; [L696] EXPR val_from_node(max_pos) VAL [gl_list={22:0}, pos={20:4}, val_from_node(max_pos)=0] [L696] max = val_from_node(max_pos) [L698] EXPR, FCALL (max_pos)->next VAL [(max_pos)->next={22:0}, gl_list={22:0}, max=0, pos={20:4}] [L698] pos = (max_pos)->next [L698] COND TRUE pos != (max_pos) VAL [gl_list={22:0}, max=0, pos={22:0}, pos={20:4}] [L699] CALL val_from_node(pos) VAL [gl_list={22:0}, head={22:0}] [L685] struct node *entry = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [entry={22:-4}, gl_list={22:0}, head={22:0}, head={22:0}] [L686] FCALL entry->value VAL [entry={22:-4}, gl_list={22:0}, head={22:0}, head={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 188 locations, 63 error locations. UNSAFE Result, 19.1s OverallTime, 32 OverallIterations, 2 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4159 SDtfs, 5188 SDslu, 17898 SDs, 0 SdLazy, 21527 SolverSat, 1167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 94 SyntacticMatches, 15 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2650 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 56/75 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 638 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1411 NumberOfCodeBlocks, 1411 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 515664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 56/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-00-08-235.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0137_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-00-08-235.csv Received shutdown request...