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/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:41:36,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:41:36,408 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:41:36,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:41:36,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:41:36,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:41:36,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:41:36,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:41:36,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:41:36,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:41:36,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:41:36,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:41:36,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:41:36,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:41:36,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:41:36,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:41:36,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:41:36,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:41:36,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:41:36,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:41:36,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:41:36,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:41:36,439 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:41:36,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:41:36,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:41:36,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:41:36,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:41:36,442 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:41:36,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:41:36,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:41:36,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:41:36,443 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:41:36,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:41:36,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:41:36,454 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:41:36,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:41:36,455 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:41:36,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:41:36,455 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:41:36,455 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:41:36,455 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:41:36,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:41:36,456 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:41:36,456 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:41:36,456 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:41:36,456 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:41:36,456 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:41:36,456 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:41:36,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:41:36,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:41:36,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:41:36,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:41:36,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:41:36,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:41:36,458 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:41:36,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:41:36,498 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:41:36,501 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:41:36,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:41:36,503 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:41:36,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:41:36,740 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:41:36,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:41:36,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:41:36,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:41:36,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:41:36,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744d6a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36, skipping insertion in model container [2018-02-02 20:41:36,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,758 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:41:36,792 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:41:36,885 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:41:36,905 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:41:36,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36 WrapperNode [2018-02-02 20:41:36,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:41:36,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:41:36,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:41:36,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:41:36,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... [2018-02-02 20:41:36,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:41:36,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:41:36,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:41:36,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:41:36,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:41:36,990 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:41:36,990 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:41:36,990 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-02 20:41:36,991 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:41:36,991 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure inspect [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-02 20:41:36,992 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:41:36,993 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:41:37,525 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:41:37,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:41:37 BoogieIcfgContainer [2018-02-02 20:41:37,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:41:37,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:41:37,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:41:37,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:41:37,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:41:36" (1/3) ... [2018-02-02 20:41:37,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9d2d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:41:37, skipping insertion in model container [2018-02-02 20:41:37,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:41:36" (2/3) ... [2018-02-02 20:41:37,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9d2d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:41:37, skipping insertion in model container [2018-02-02 20:41:37,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:41:37" (3/3) ... [2018-02-02 20:41:37,532 INFO L107 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-02-02 20:41:37,539 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:41:37,545 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-02-02 20:41:37,576 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:41:37,576 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:41:37,576 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:41:37,576 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:41:37,576 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:41:37,576 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:41:37,577 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:41:37,577 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:41:37,577 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:41:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states. [2018-02-02 20:41:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 20:41:37,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:37,603 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 20:41:37,603 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 19743518, now seen corresponding path program 1 times [2018-02-02 20:41:37,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:37,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:37,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:37,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:41:37,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:37,710 INFO L182 omatonBuilderFactory]: Interpolants [272#false, 273#(= 1 (select |#valid| |~#gl_list.base|)), 271#true] [2018-02-02 20:41:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:37,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:41:37,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:41:37,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:37,790 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 3 states. [2018-02-02 20:41:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:37,947 INFO L93 Difference]: Finished difference Result 263 states and 285 transitions. [2018-02-02 20:41:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:41:37,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 20:41:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:37,957 INFO L225 Difference]: With dead ends: 263 [2018-02-02 20:41:37,957 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 20:41:37,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 20:41:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-02-02 20:41:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:41:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-02-02 20:41:37,999 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 4 [2018-02-02 20:41:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:38,000 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-02-02 20:41:38,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:41:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-02-02 20:41:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 20:41:38,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:38,000 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 20:41:38,001 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:38,001 INFO L82 PathProgramCache]: Analyzing trace with hash 19743519, now seen corresponding path program 1 times [2018-02-02 20:41:38,002 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:38,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:38,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:41:38,058 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,059 INFO L182 omatonBuilderFactory]: Interpolants [780#true, 781#false, 782#(and (= (select |#length| |~#gl_list.base|) 8) (= |~#gl_list.offset| 0))] [2018-02-02 20:41:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:41:38,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:41:38,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:38,060 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 3 states. [2018-02-02 20:41:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:38,224 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2018-02-02 20:41:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:41:38,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 20:41:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:38,227 INFO L225 Difference]: With dead ends: 245 [2018-02-02 20:41:38,227 INFO L226 Difference]: Without dead ends: 245 [2018-02-02 20:41:38,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:41:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-02-02 20:41:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-02-02 20:41:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 20:41:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 250 transitions. [2018-02-02 20:41:38,238 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 250 transitions. Word has length 4 [2018-02-02 20:41:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:38,238 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 250 transitions. [2018-02-02 20:41:38,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:41:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 250 transitions. [2018-02-02 20:41:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:41:38,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:38,239 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:38,239 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash -935456334, now seen corresponding path program 1 times [2018-02-02 20:41:38,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:38,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:38,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:38,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:38,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,299 INFO L182 omatonBuilderFactory]: Interpolants [1269#true, 1270#false, 1271#(= 1 (select |#valid| |gl_insert_#t~malloc24.base|)), 1272#(= 1 (select |#valid| gl_insert_~node~1.base))] [2018-02-02 20:41:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:38,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:38,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:38,300 INFO L87 Difference]: Start difference. First operand 241 states and 250 transitions. Second operand 4 states. [2018-02-02 20:41:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:38,451 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-02-02 20:41:38,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:41:38,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 20:41:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:38,453 INFO L225 Difference]: With dead ends: 238 [2018-02-02 20:41:38,453 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 20:41:38,453 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 20:41:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-02 20:41:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 20:41:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2018-02-02 20:41:38,463 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 16 [2018-02-02 20:41:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:38,464 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2018-02-02 20:41:38,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2018-02-02 20:41:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:41:38,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:38,464 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:38,465 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash -935456333, now seen corresponding path program 1 times [2018-02-02 20:41:38,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:38,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:38,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:38,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,531 INFO L182 omatonBuilderFactory]: Interpolants [1751#true, 1752#false, 1753#(and (= 0 |gl_insert_#t~malloc24.offset|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|))), 1754#(and (= (select |#length| gl_insert_~node~1.base) 20) (= gl_insert_~node~1.offset 0))] [2018-02-02 20:41:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:38,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:38,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:38,532 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 4 states. [2018-02-02 20:41:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:38,624 INFO L93 Difference]: Finished difference Result 235 states and 244 transitions. [2018-02-02 20:41:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:41:38,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 20:41:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:38,625 INFO L225 Difference]: With dead ends: 235 [2018-02-02 20:41:38,625 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 20:41:38,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 20:41:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-02-02 20:41:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 20:41:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2018-02-02 20:41:38,630 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 16 [2018-02-02 20:41:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:38,630 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2018-02-02 20:41:38,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2018-02-02 20:41:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:41:38,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:38,631 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:38,631 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730920, now seen corresponding path program 1 times [2018-02-02 20:41:38,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:38,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:38,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:38,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,704 INFO L182 omatonBuilderFactory]: Interpolants [2227#true, 2228#false, 2229#(= 1 (select |#valid| |~#gl_list.base|)), 2230#(or (= 1 (select |#valid| |~#gl_list.base|)) (= |~#gl_list.base| |gl_insert_#t~malloc24.base|)), 2231#(or (= 1 (select |#valid| |~#gl_list.base|)) (= gl_insert_~node~1.base |~#gl_list.base|)), 2232#(= 1 (select |#valid| |list_add_#in~head.base|)), 2233#(= 1 (select |#valid| list_add_~head.base))] [2018-02-02 20:41:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:38,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:41:38,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:41:38,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:38,704 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 7 states. [2018-02-02 20:41:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:38,911 INFO L93 Difference]: Finished difference Result 243 states and 251 transitions. [2018-02-02 20:41:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:41:38,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 20:41:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:38,913 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:41:38,913 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:41:38,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:41:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-02-02 20:41:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 20:41:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-02-02 20:41:38,920 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 19 [2018-02-02 20:41:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:38,921 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-02-02 20:41:38,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:41:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-02-02 20:41:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:41:38,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:38,921 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:38,921 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730921, now seen corresponding path program 1 times [2018-02-02 20:41:38,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:38,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:39,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:39,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:41:39,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:39,058 INFO L182 omatonBuilderFactory]: Interpolants [2724#true, 2725#false, 2726#(and (= 0 |~#gl_list.offset|) (= (select |#length| |~#gl_list.base|) 8)), 2727#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|) (= (select |#length| |~#gl_list.base|) 8)), 2728#(and (<= 8 (select |#length| |~#gl_list.base|)) (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|)), 2729#(and (<= 8 (select |#length| |~#gl_list.base|)) (= 0 |~#gl_list.offset|) (not (= |~#gl_list.base| |gl_insert_#t~malloc24.base|))), 2730#(and (<= 8 (select |#length| |~#gl_list.base|)) (= 0 |~#gl_list.offset|)), 2731#(and (= 0 |list_add_#in~head.offset|) (<= 8 (select |#length| |list_add_#in~head.base|))), 2732#(and (<= 8 (select |#length| list_add_~head.base)) (= list_add_~head.offset 0))] [2018-02-02 20:41:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:39,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:41:39,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:41:39,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:41:39,059 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 9 states. [2018-02-02 20:41:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:39,400 INFO L93 Difference]: Finished difference Result 238 states and 246 transitions. [2018-02-02 20:41:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:41:39,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 20:41:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:39,401 INFO L225 Difference]: With dead ends: 238 [2018-02-02 20:41:39,402 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 20:41:39,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:41:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 20:41:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-02 20:41:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 20:41:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 246 transitions. [2018-02-02 20:41:39,408 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 246 transitions. Word has length 19 [2018-02-02 20:41:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:39,409 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 246 transitions. [2018-02-02 20:41:39,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:41:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 246 transitions. [2018-02-02 20:41:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:41:39,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:39,409 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:39,410 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173164, now seen corresponding path program 1 times [2018-02-02 20:41:39,411 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:39,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:39,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:39,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:41:39,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:39,519 INFO L182 omatonBuilderFactory]: Interpolants [3216#false, 3217#(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|))), 3218#(and (not (= |~#gl_list.base| |gl_insert_#t~malloc24.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 3219#(and (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))), 3220#(= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)), 3221#(= list_add_~head.base (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)), 3222#(= 1 (select |#valid| |list_add_#t~mem21.base|)), 3223#(= 1 (select |#valid| |__list_add_#in~next.base|)), 3224#(= 1 (select |#valid| __list_add_~next.base)), 3215#true] [2018-02-02 20:41:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:39,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:41:39,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:41:39,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:41:39,520 INFO L87 Difference]: Start difference. First operand 238 states and 246 transitions. Second operand 10 states. [2018-02-02 20:41:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:39,989 INFO L93 Difference]: Finished difference Result 264 states and 274 transitions. [2018-02-02 20:41:39,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:41:39,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 20:41:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:39,991 INFO L225 Difference]: With dead ends: 264 [2018-02-02 20:41:39,991 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 20:41:39,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:41:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 20:41:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-02-02 20:41:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-02 20:41:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2018-02-02 20:41:39,997 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 22 [2018-02-02 20:41:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:39,997 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2018-02-02 20:41:39,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:41:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2018-02-02 20:41:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:41:39,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:39,997 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:39,997 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173165, now seen corresponding path program 1 times [2018-02-02 20:41:39,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:40,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:40,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:40,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:41:40,224 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:40,225 INFO L182 omatonBuilderFactory]: Interpolants [3761#true, 3762#false, 3763#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 3764#(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|))), 3765#(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_#t~malloc24.base|)) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 3766#(and (= 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|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))), 3767#(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|))), 3768#(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))), 3769#(and (= list_add_~head.base |list_add_#t~mem21.base|) (= 8 (select |#length| list_add_~head.base)) (= 0 |list_add_#t~mem21.offset|)), 3770#(and (= 8 (select |#length| |__list_add_#in~next.base|)) (= 0 |__list_add_#in~next.offset|)), 3771#(and (= __list_add_~next.offset 0) (= 8 (select |#length| __list_add_~next.base)))] [2018-02-02 20:41:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:40,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:41:40,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:41:40,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:41:40,226 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand 11 states. [2018-02-02 20:41:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:40,948 INFO L93 Difference]: Finished difference Result 484 states and 500 transitions. [2018-02-02 20:41:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:41:40,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 20:41:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:40,951 INFO L225 Difference]: With dead ends: 484 [2018-02-02 20:41:40,951 INFO L226 Difference]: Without dead ends: 484 [2018-02-02 20:41:40,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:41:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-02-02 20:41:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2018-02-02 20:41:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-02-02 20:41:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 473 transitions. [2018-02-02 20:41:40,960 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 473 transitions. Word has length 22 [2018-02-02 20:41:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:40,961 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 473 transitions. [2018-02-02 20:41:40,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:41:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 473 transitions. [2018-02-02 20:41:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:41:40,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:40,962 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:40,962 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash -598304902, now seen corresponding path program 1 times [2018-02-02 20:41:40,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:40,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:41,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,032 INFO L182 omatonBuilderFactory]: Interpolants [4676#true, 4677#false, 4678#(= 1 (select |#valid| gl_insert_~node~1.base)), 4679#(= 1 (select |#valid| |list_add_#in~new.base|)), 4680#(= 1 (select |#valid| list_add_~new.base)), 4681#(= 1 (select |#valid| |__list_add_#in~new.base|)), 4682#(= 1 (select |#valid| __list_add_~new.base))] [2018-02-02 20:41:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:41:41,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:41:41,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:41,033 INFO L87 Difference]: Start difference. First operand 400 states and 473 transitions. Second operand 7 states. [2018-02-02 20:41:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:41,337 INFO L93 Difference]: Finished difference Result 412 states and 481 transitions. [2018-02-02 20:41:41,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:41:41,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 20:41:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:41,339 INFO L225 Difference]: With dead ends: 412 [2018-02-02 20:41:41,339 INFO L226 Difference]: Without dead ends: 412 [2018-02-02 20:41:41,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:41:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-02 20:41:41,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 271. [2018-02-02 20:41:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 20:41:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 288 transitions. [2018-02-02 20:41:41,347 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 288 transitions. Word has length 23 [2018-02-02 20:41:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:41,347 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 288 transitions. [2018-02-02 20:41:41,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:41:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 288 transitions. [2018-02-02 20:41:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:41:41,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:41,348 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:41,348 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash -598304901, now seen corresponding path program 1 times [2018-02-02 20:41:41,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:41,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:41:41,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,446 INFO L182 omatonBuilderFactory]: Interpolants [5376#(and (= 20 (select |#length| |__list_add_#in~new.base|)) (<= 4 |__list_add_#in~new.offset|) (<= |__list_add_#in~new.offset| 4)), 5377#(and (<= __list_add_~new.offset 4) (= (select |#length| __list_add_~new.base) 20) (<= 4 __list_add_~new.offset)), 5370#true, 5371#false, 5372#(and (= 0 |gl_insert_#t~malloc24.offset|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|))), 5373#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= gl_insert_~node~1.offset 0)), 5374#(and (<= 4 |list_add_#in~new.offset|) (= 20 (select |#length| |list_add_#in~new.base|)) (<= |list_add_#in~new.offset| 4)), 5375#(and (<= 4 list_add_~new.offset) (<= list_add_~new.offset 4) (= 20 (select |#length| list_add_~new.base)))] [2018-02-02 20:41:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:41:41,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:41:41,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:41:41,447 INFO L87 Difference]: Start difference. First operand 271 states and 288 transitions. Second operand 8 states. [2018-02-02 20:41:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:41,676 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2018-02-02 20:41:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:41:41,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 20:41:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:41,677 INFO L225 Difference]: With dead ends: 275 [2018-02-02 20:41:41,677 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 20:41:41,678 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:41:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 20:41:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-02-02 20:41:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 20:41:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 284 transitions. [2018-02-02 20:41:41,682 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 284 transitions. Word has length 23 [2018-02-02 20:41:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:41,682 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 284 transitions. [2018-02-02 20:41:41,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:41:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 284 transitions. [2018-02-02 20:41:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:41:41,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:41,683 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:41,683 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash 554606109, now seen corresponding path program 1 times [2018-02-02 20:41:41,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:41,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:41:41,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,727 INFO L182 omatonBuilderFactory]: Interpolants [5930#true, 5931#false, 5932#(= 1 (select |#valid| list_add_~head.base)), 5933#(= 1 (select |#valid| |__list_add_#in~prev.base|)), 5934#(= 1 (select |#valid| __list_add_~prev.base))] [2018-02-02 20:41:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:41:41,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:41:41,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:41,728 INFO L87 Difference]: Start difference. First operand 271 states and 284 transitions. Second operand 5 states. [2018-02-02 20:41:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:41,907 INFO L93 Difference]: Finished difference Result 270 states and 281 transitions. [2018-02-02 20:41:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:41:41,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 20:41:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:41,908 INFO L225 Difference]: With dead ends: 270 [2018-02-02 20:41:41,909 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 20:41:41,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:41:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 20:41:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-02-02 20:41:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 20:41:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 281 transitions. [2018-02-02 20:41:41,915 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 281 transitions. Word has length 25 [2018-02-02 20:41:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:41,915 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 281 transitions. [2018-02-02 20:41:41,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:41:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2018-02-02 20:41:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:41:41,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:41,916 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:41,916 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash 554606110, now seen corresponding path program 1 times [2018-02-02 20:41:41,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:41,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:41,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:41:41,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,997 INFO L182 omatonBuilderFactory]: Interpolants [6480#(= 0 |list_add_#in~head.offset|), 6481#(= 0 list_add_~head.offset), 6482#(and (= 0 list_add_~head.offset) (<= (+ list_add_~head.offset 4) (select |#length| list_add_~head.base))), 6483#(and (= 0 |__list_add_#in~prev.offset|) (<= 4 (select |#length| |__list_add_#in~prev.base|))), 6484#(and (= __list_add_~prev.offset 0) (<= 4 (select |#length| __list_add_~prev.base))), 6477#true, 6478#false, 6479#(= 0 |~#gl_list.offset|)] [2018-02-02 20:41:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:41,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:41:41,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:41:41,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:41:41,997 INFO L87 Difference]: Start difference. First operand 270 states and 281 transitions. Second operand 8 states. [2018-02-02 20:41:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,169 INFO L93 Difference]: Finished difference Result 272 states and 279 transitions. [2018-02-02 20:41:42,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:41:42,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 20:41:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,170 INFO L225 Difference]: With dead ends: 272 [2018-02-02 20:41:42,170 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 20:41:42,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:41:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 20:41:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-02-02 20:41:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 20:41:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 279 transitions. [2018-02-02 20:41:42,176 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 279 transitions. Word has length 25 [2018-02-02 20:41:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,176 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 279 transitions. [2018-02-02 20:41:42,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:41:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 279 transitions. [2018-02-02 20:41:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:42,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,178 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:42,178 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:42,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658537, now seen corresponding path program 1 times [2018-02-02 20:41:42,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:41:42,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,315 INFO L182 omatonBuilderFactory]: Interpolants [7040#(and (= list_add_~head.base |list_add_#in~head.base|) (= |list_add_#in~head.offset| list_add_~head.offset)), 7041#(and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~prev.offset 0)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 7042#(or (<= 4 (select |#length| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~prev.offset| 0))), 7043#(or (<= 4 (select |#length| |list_add_#in~head.base|)) (not (= |list_add_#in~head.offset| 0))), 7044#(or (<= 4 (select |#length| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0))), 7045#(and (= 0 |~#gl_list.offset|) (<= 4 (select |#length| |~#gl_list.base|))), 7046#(and (= 0 |inspect_#in~head.offset|) (<= 4 (select |#length| |inspect_#in~head.base|))), 7047#(and (= inspect_~head.offset 0) (<= 4 (select |#length| inspect_~head.base))), 7037#true, 7038#false, 7039#(= 0 |~#gl_list.offset|)] [2018-02-02 20:41:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:41:42,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:41:42,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:41:42,316 INFO L87 Difference]: Start difference. First operand 270 states and 279 transitions. Second operand 11 states. [2018-02-02 20:41:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,703 INFO L93 Difference]: Finished difference Result 269 states and 278 transitions. [2018-02-02 20:41:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:41:42,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 20:41:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,704 INFO L225 Difference]: With dead ends: 269 [2018-02-02 20:41:42,704 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 20:41:42,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:41:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 20:41:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-02-02 20:41:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 20:41:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 278 transitions. [2018-02-02 20:41:42,708 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 278 transitions. Word has length 48 [2018-02-02 20:41:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:42,708 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 278 transitions. [2018-02-02 20:41:42,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:41:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 278 transitions. [2018-02-02 20:41:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:41:42,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:42,708 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:42,709 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658536, now seen corresponding path program 1 times [2018-02-02 20:41:42,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:42,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:42,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:41:42,771 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,771 INFO L182 omatonBuilderFactory]: Interpolants [7600#true, 7601#false, 7602#(= list_add_~head.base |list_add_#in~head.base|), 7603#(= 1 (select |#valid| |list_add_#in~head.base|)), 7604#(= 1 (select |#valid| |~#gl_list.base|)), 7605#(= 1 (select |#valid| |inspect_#in~head.base|)), 7606#(= 1 (select |#valid| inspect_~head.base))] [2018-02-02 20:41:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:42,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:41:42,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:41:42,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:41:42,772 INFO L87 Difference]: Start difference. First operand 269 states and 278 transitions. Second operand 7 states. [2018-02-02 20:41:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:42,996 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-02-02 20:41:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:41:42,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-02 20:41:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:42,997 INFO L225 Difference]: With dead ends: 264 [2018-02-02 20:41:42,997 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 20:41:42,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:41:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 20:41:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-02-02 20:41:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 20:41:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 273 transitions. [2018-02-02 20:41:43,002 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 273 transitions. Word has length 48 [2018-02-02 20:41:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:43,003 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 273 transitions. [2018-02-02 20:41:43,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:41:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 273 transitions. [2018-02-02 20:41:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:41:43,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:43,004 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, 1, 1, 1, 1] [2018-02-02 20:41:43,004 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash 652522709, now seen corresponding path program 1 times [2018-02-02 20:41:43,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:43,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:43,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:41:43,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,384 INFO L182 omatonBuilderFactory]: Interpolants [8160#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (= |gl_insert_#t~malloc24.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| |gl_insert_#t~malloc24.base|))), 8161#(and (not (= gl_insert_~node~1.base |~#gl_list.base|)) (or (= gl_insert_~node~1.base (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 8162#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 8163#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 8164#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset))), 8165#(= 1 (select |#valid| |list_add_#t~mem21.base|)), 8166#(= 1 (select |#valid| |__list_add_#in~next.base|)), 8167#(= 1 (select |#valid| __list_add_~next.base)), 8145#true, 8146#false, 8147#(= (select |#valid| |~#gl_list.base|) 1), 8148#(= |#valid| |old(#valid)|), 8149#(and (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= 1 (select |#valid| |gl_insert_#t~malloc24.base|))), 8150#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= 1 (select |#valid| gl_insert_~node~1.base))), 8151#(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)), 8152#(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)), 8153#(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|)), 8154#(= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)), 8155#(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|))), 8156#(or (and (= (select |#valid| |~#gl_list.base|) 1) (not (= gl_insert_~node~1.base |~#gl_list.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)))) (= 0 (select |old(#valid)| |~#gl_list.base|))), 8157#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|))) (= (select |#valid| |~#gl_list.base|) 1))), 8158#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 8159#(and (= (select |#valid| |~#gl_list.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))] [2018-02-02 20:41:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:43,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:41:43,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:41:43,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:41:43,385 INFO L87 Difference]: Start difference. First operand 264 states and 273 transitions. Second operand 23 states. [2018-02-02 20:41:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:45,401 INFO L93 Difference]: Finished difference Result 434 states and 451 transitions. [2018-02-02 20:41:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:41:45,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-02 20:41:45,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:45,404 INFO L225 Difference]: With dead ends: 434 [2018-02-02 20:41:45,404 INFO L226 Difference]: Without dead ends: 434 [2018-02-02 20:41:45,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1398, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:41:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-02-02 20:41:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 365. [2018-02-02 20:41:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 20:41:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 407 transitions. [2018-02-02 20:41:45,414 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 407 transitions. Word has length 52 [2018-02-02 20:41:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:45,414 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 407 transitions. [2018-02-02 20:41:45,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:41:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 407 transitions. [2018-02-02 20:41:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:41:45,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:45,415 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, 1, 1, 1, 1] [2018-02-02 20:41:45,415 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash 652522710, now seen corresponding path program 1 times [2018-02-02 20:41:45,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:45,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:41:45,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:41:45,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,959 INFO L182 omatonBuilderFactory]: Interpolants [9024#(and (<= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) 4) (= |list_add_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= 20 (select |#length| |list_add_#t~mem21.base|)) (<= 4 (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset))), 9025#(and (<= |__list_add_#in~next.offset| 4) (<= 4 |__list_add_#in~next.offset|) (= 20 (select |#length| |__list_add_#in~next.base|))), 9026#(and (= (select |#length| __list_add_~next.base) 20) (<= __list_add_~next.offset 4) (<= 4 __list_add_~next.offset)), 9004#true, 9005#false, 9006#(= (select |#valid| |~#gl_list.base|) 1), 9007#(= |#valid| |old(#valid)|), 9008#(and (= 0 |gl_insert_#t~malloc24.offset|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|))), 9009#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= gl_insert_~node~1.offset 0)), 9010#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base)), 9011#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#in~new.base| list_add_~new.base) (= (select |#valid| list_add_~head.base) 1)), 9012#(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|)), 9013#(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|)), 9014#(and (= (select |#valid| |list_add_#in~head.base|) 1) (<= |list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|))), 9015#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= 20 (select |#length| gl_insert_~node~1.base)) (<= (+ gl_insert_~node~1.offset 4) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|)) (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ gl_insert_~node~1.offset 4)) (not (= gl_insert_~node~1.base |~#gl_list.base|)) (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (= gl_insert_~node~1.offset 0))), 9016#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ gl_insert_~node~1.offset 4)) (= 20 (select |#length| gl_insert_~node~1.base)) (= (select |#valid| |~#gl_list.base|) 1) (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (<= (+ gl_insert_~node~1.offset 4) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|)) (= gl_insert_~node~1.offset 0))), 9017#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 9018#(and (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|)) (= (select |#valid| |~#gl_list.base|) 1) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 9019#(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) (not (= |~#gl_list.base| |gl_insert_#t~malloc24.base|)) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 9020#(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) (not (= gl_insert_~node~1.base |~#gl_list.base|)) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 9021#(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) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))), 9022#(and (<= (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|)) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)))), 9023#(and (<= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) 4) (= 20 (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)))] [2018-02-02 20:41:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:45,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:41:45,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:41:45,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:41:45,960 INFO L87 Difference]: Start difference. First operand 365 states and 407 transitions. Second operand 23 states. [2018-02-02 20:41:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:48,499 INFO L93 Difference]: Finished difference Result 433 states and 450 transitions. [2018-02-02 20:41:48,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:41:48,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-02 20:41:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:48,500 INFO L225 Difference]: With dead ends: 433 [2018-02-02 20:41:48,501 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 20:41:48,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=263, Invalid=1629, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:41:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 20:41:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 338. [2018-02-02 20:41:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:41:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 379 transitions. [2018-02-02 20:41:48,506 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 379 transitions. Word has length 52 [2018-02-02 20:41:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:48,506 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 379 transitions. [2018-02-02 20:41:48,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:41:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 379 transitions. [2018-02-02 20:41:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:41:48,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:48,506 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] [2018-02-02 20:41:48,506 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:48,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1566668974, now seen corresponding path program 1 times [2018-02-02 20:41:48,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:48,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:48,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:41:48,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,666 INFO L182 omatonBuilderFactory]: Interpolants [9841#true, 9842#false, 9843#(and (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 9844#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|) (= 8 (select |#length| |~#gl_list.base|))), 9845#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 9846#(and (= (store |old(#length)| |gl_insert_#t~malloc24.base| (select |#length| |gl_insert_#t~malloc24.base|)) |#length|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|))), 9847#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= gl_insert_~node~1.base (@diff |old(#length)| |#length|)) (= 0 (select |old(#valid)| gl_insert_~node~1.base))) (= |old(#length)| |#length|))), 9848#(= list_add_~head.base |list_add_#in~head.base|), 9849#(= __list_add_~prev.base |__list_add_#in~prev.base|), 9850#(or (and (= 0 (select |old(#valid)| |~#gl_list.base|)) (= |~#gl_list.base| gl_insert_~node~1.base)) (<= 8 (select |#length| |~#gl_list.base|)) (not (= (select |old(#length)| |~#gl_list.base|) 8))), 9851#(or (<= 8 (select |#length| |~#gl_list.base|)) (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= (select |old(#length)| |~#gl_list.base|) 8))), 9852#(and (<= 8 (select |#length| |~#gl_list.base|)) (= 0 |~#gl_list.offset|)), 9853#(and (= 0 |inspect_#in~head.offset|) (<= 8 (select |#length| |inspect_#in~head.base|))), 9854#(and (= inspect_~head.offset 0) (<= 8 (select |#length| inspect_~head.base)))] [2018-02-02 20:41:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:48,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:41:48,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:41:48,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:41:48,667 INFO L87 Difference]: Start difference. First operand 338 states and 379 transitions. Second operand 14 states. [2018-02-02 20:41:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:49,235 INFO L93 Difference]: Finished difference Result 350 states and 391 transitions. [2018-02-02 20:41:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:41:49,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 20:41:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:49,236 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:41:49,236 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:41:49,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:41:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:41:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 336. [2018-02-02 20:41:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 20:41:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 375 transitions. [2018-02-02 20:41:49,242 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 375 transitions. Word has length 52 [2018-02-02 20:41:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:49,242 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 375 transitions. [2018-02-02 20:41:49,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:41:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 375 transitions. [2018-02-02 20:41:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:41:49,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:49,243 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, 1, 1, 1] [2018-02-02 20:41:49,243 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557105, now seen corresponding path program 1 times [2018-02-02 20:41:49,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:49,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:49,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:49,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 20:41:49,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:49,989 INFO L182 omatonBuilderFactory]: Interpolants [10562#true, 10563#false, 10564#(= |~#gl_list.offset| 0), 10565#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 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|))), 10566#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10567#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10568#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10569#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= (select |#valid| gl_insert_~node~1.base) 1) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|)), 10570#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10571#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 10572#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 10573#(and (or (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.base |__list_add_#in~prev.base|)))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 10574#(and (or (not (= __list_add_~next.offset 0)) (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (and (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (not (= __list_add_~next.base __list_add_~prev.base)))) (= __list_add_~next.base __list_add_~new.base)) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))))))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 10575#(or (and (not (= __list_add_~prev.offset 4)) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4))) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0)))), 10576#(or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= __list_add_~prev.base |__list_add_#in~prev.base|) (= |__list_add_#in~new.base| (select (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base) (+ (- 0) 4)))) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0)))), 10577#(or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4))) (not (= |__list_add_#in~prev.offset| 0))), 10578#(or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (not (= |list_add_#in~head.offset| 0)) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4))) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))), 10579#(or (and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (and (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= (select |#valid| gl_insert_~node~1.base) 1)))) (not (= |~#gl_list.offset| 0))), 10580#(or (not (= |~#gl_list.offset| 0)) (and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))))), 10581#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 10582#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= |~#gl_list.offset| 0)), 10583#(and (= 0 |inspect_#in~head.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4))))), 10584#(and (= inspect_~head.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))))), 10585#(= 1 (select |#valid| |inspect_#t~mem2.base|)), 10586#(= 1 (select |#valid| inspect_~head.base))] [2018-02-02 20:41:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:49,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:41:49,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:41:49,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:41:49,990 INFO L87 Difference]: Start difference. First operand 336 states and 375 transitions. Second operand 25 states. [2018-02-02 20:41:52,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:52,650 INFO L93 Difference]: Finished difference Result 539 states and 599 transitions. [2018-02-02 20:41:52,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:41:52,651 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-02-02 20:41:52,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:52,652 INFO L225 Difference]: With dead ends: 539 [2018-02-02 20:41:52,652 INFO L226 Difference]: Without dead ends: 539 [2018-02-02 20:41:52,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=2149, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:41:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-02 20:41:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 458. [2018-02-02 20:41:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-02 20:41:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 538 transitions. [2018-02-02 20:41:52,662 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 538 transitions. Word has length 61 [2018-02-02 20:41:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:52,663 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 538 transitions. [2018-02-02 20:41:52,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:41:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 538 transitions. [2018-02-02 20:41:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:41:52,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:52,664 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, 1, 1, 1] [2018-02-02 20:41:52,664 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:52,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557104, now seen corresponding path program 1 times [2018-02-02 20:41:52,665 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:52,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:53,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 20:41:53,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,673 INFO L182 omatonBuilderFactory]: Interpolants [11648#(and (or (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0))) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (not (= __list_add_~prev.offset 4)) (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset)) __list_add_~prev.base) (+ (- 0) 4))))))) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 11649#(and (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0))) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| (select (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base) (+ (- 0) 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (or (= __list_add_~new.offset (select (store (select |#memory_$Pointer$.offset| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.offset) (+ (- 0) 4))) (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)))))), 11650#(or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (+ (- 0) 4))) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (+ (- 0) 4)) |__list_add_#in~new.offset|) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4)))) (not (= |__list_add_#in~prev.offset| 0))), 11651#(or (and (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (+ (- 0) 4)) |list_add_#in~new.offset|) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4))) (<= |list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (+ (- 0) 4)))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (not (= |list_add_#in~head.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))), 11652#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (and (<= (+ gl_insert_~node~1.offset 4) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (+ gl_insert_~node~1.offset 4)) (= 20 (select |#length| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= gl_insert_~node~1.offset 0))) (not (= |~#gl_list.base| gl_insert_~node~1.base)))), 11653#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 11654#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4) (= |~#gl_list.offset| 0) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))), 11655#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4)))) (<= (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)) 4) (= 0 |inspect_#in~head.offset|) (<= 4 (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)))), 11656#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (<= 4 (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4))) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 11657#(and (<= 4 |inspect_#t~mem2.offset|) (<= |inspect_#t~mem2.offset| 4) (= 20 (select |#length| |inspect_#t~mem2.base|))), 11658#(and (<= inspect_~head.offset 4) (<= 4 inspect_~head.offset) (= 20 (select |#length| inspect_~head.base))), 11635#true, 11636#false, 11637#(= |~#gl_list.offset| 0), 11638#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 0 (select (store (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.offset|) |~#gl_list.offset|)) (= (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)), 11639#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11640#(and (= 0 |gl_insert_#t~malloc24.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11641#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= gl_insert_~node~1.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11642#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|) (= gl_insert_~node~1.offset 0)), 11643#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11644#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 11645#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 11646#(and (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (or (and (or (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (<= __list_add_~new.offset |__list_add_#in~new.offset|)))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))) (= __list_add_~next.base __list_add_~new.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 11647#(and (or (and (or (not (= __list_add_~next.offset 0)) (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (and (or (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= __list_add_~next.base __list_add_~prev.base))) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) __list_add_~new.offset __list_add_~next.offset)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (not (= __list_add_~next.base __list_add_~prev.base)))) (= (+ __list_add_~next.offset 4) __list_add_~prev.offset)))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))) (= __list_add_~next.base __list_add_~new.base)) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.base |__list_add_#in~prev.base|))] [2018-02-02 20:41:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:53,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:41:53,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:41:53,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:41:53,674 INFO L87 Difference]: Start difference. First operand 458 states and 538 transitions. Second operand 24 states. [2018-02-02 20:41:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:56,576 INFO L93 Difference]: Finished difference Result 552 states and 613 transitions. [2018-02-02 20:41:56,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:41:56,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-02 20:41:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:56,578 INFO L225 Difference]: With dead ends: 552 [2018-02-02 20:41:56,578 INFO L226 Difference]: Without dead ends: 552 [2018-02-02 20:41:56,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=2056, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:41:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-02-02 20:41:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 458. [2018-02-02 20:41:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-02-02 20:41:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 535 transitions. [2018-02-02 20:41:56,588 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 535 transitions. Word has length 61 [2018-02-02 20:41:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:56,589 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 535 transitions. [2018-02-02 20:41:56,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:41:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 535 transitions. [2018-02-02 20:41:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:41:56,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:56,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:56,590 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:56,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137695, now seen corresponding path program 1 times [2018-02-02 20:41:56,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:56,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:56,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:56,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:41:56,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:56,635 INFO L182 omatonBuilderFactory]: Interpolants [12721#true, 12722#false, 12723#(= (select |#valid| inspect_~head.base) 1), 12724#(= 1 (select |#valid| inspect_~node~0.base))] [2018-02-02 20:41:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:56,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:41:56,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:41:56,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:41:56,636 INFO L87 Difference]: Start difference. First operand 458 states and 535 transitions. Second operand 4 states. [2018-02-02 20:41:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:41:56,748 INFO L93 Difference]: Finished difference Result 452 states and 517 transitions. [2018-02-02 20:41:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:41:56,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 20:41:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:41:56,750 INFO L225 Difference]: With dead ends: 452 [2018-02-02 20:41:56,750 INFO L226 Difference]: Without dead ends: 452 [2018-02-02 20:41:56,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:41:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-02 20:41:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2018-02-02 20:41:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 20:41:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 517 transitions. [2018-02-02 20:41:56,758 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 517 transitions. Word has length 73 [2018-02-02 20:41:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:41:56,759 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 517 transitions. [2018-02-02 20:41:56,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:41:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 517 transitions. [2018-02-02 20:41:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:41:56,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:41:56,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:41:56,760 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:41:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137694, now seen corresponding path program 1 times [2018-02-02 20:41:56,761 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:41:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:41:56,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:41:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:57,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:41:57,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-02-02 20:41:57,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:41:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:57,887 INFO L182 omatonBuilderFactory]: Interpolants [13632#false, 13633#(= |~#gl_list.offset| 0), 13634#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 0 (select (store (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.offset|) |~#gl_list.offset|)) (= (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)), 13635#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13636#(and (= 0 |gl_insert_#t~malloc24.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13637#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= gl_insert_~node~1.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13638#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|) (= gl_insert_~node~1.offset 0)), 13639#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13640#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 13641#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 13642#(and (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= __list_add_~next.base __list_add_~new.base) (and (or (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (and (= |__list_add_#in~new.base| __list_add_~new.base) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))))), 13643#(and (or (and (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) __list_add_~new.offset __list_add_~next.offset)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)))) (not (= __list_add_~next.base __list_add_~prev.base)))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))) (= __list_add_~next.base __list_add_~new.base)) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 13644#(and (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (not (= __list_add_~prev.offset 4)) (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset)) __list_add_~prev.base) (+ (- 0) 4))) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0))))), 13645#(and (or (and (= __list_add_~new.offset (select (store (select |#memory_$Pointer$.offset| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.offset) (+ (- 0) 4))) (= |__list_add_#in~new.base| (select (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base) (+ (- 0) 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0)))) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 13646#(or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (+ (- 0) 4)) |__list_add_#in~new.offset|) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4)))) (not (= |__list_add_#in~prev.offset| 0))), 13647#(or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (not (= |list_add_#in~head.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0)) (and (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (+ (- 0) 4)) |list_add_#in~new.offset|) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4))))), 13648#(or (and (or (and (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (+ gl_insert_~node~1.offset 4)) (= 20 (select |#length| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= gl_insert_~node~1.offset 0)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (= 0 (select |old(#valid)| |~#gl_list.base|))), 13649#(or (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4)) (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 13650#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= |~#gl_list.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4)), 13651#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4)))) (<= (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)) 4) (= 0 |inspect_#in~head.offset|)), 13652#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 13653#(and (<= |inspect_#t~mem2.offset| 4) (= 20 (select |#length| |inspect_#t~mem2.base|))), 13654#(and (<= inspect_~head.offset 4) (= 20 (select |#length| inspect_~head.base))), 13655#(and (<= inspect_~head.offset 4) (<= 0 inspect_~head.offset) (= 20 (select |#length| inspect_~head.base))), 13656#(and (<= 0 (+ inspect_~node~0.offset 4)) (<= inspect_~node~0.offset 0) (= (select |#length| inspect_~node~0.base) 20)), 13631#true] [2018-02-02 20:41:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:41:57,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:41:57,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:41:57,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:41:57,887 INFO L87 Difference]: Start difference. First operand 452 states and 517 transitions. Second operand 26 states. [2018-02-02 20:42:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:00,886 INFO L93 Difference]: Finished difference Result 534 states and 589 transitions. [2018-02-02 20:42:00,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:42:00,886 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-02-02 20:42:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:00,888 INFO L225 Difference]: With dead ends: 534 [2018-02-02 20:42:00,888 INFO L226 Difference]: Without dead ends: 534 [2018-02-02 20:42:00,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:42:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-02-02 20:42:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 452. [2018-02-02 20:42:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-02 20:42:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2018-02-02 20:42:00,895 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 73 [2018-02-02 20:42:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:00,895 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2018-02-02 20:42:00,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:42:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2018-02-02 20:42:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:42:00,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:00,896 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:00,897 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:00,897 INFO L82 PathProgramCache]: Analyzing trace with hash 935805702, now seen corresponding path program 1 times [2018-02-02 20:42:00,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:00,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:01,737 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 41 DAG size of output 33 [2018-02-02 20:42:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:02,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:02,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 20:42:02,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:02,757 INFO L182 omatonBuilderFactory]: Interpolants [14720#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|))), 14721#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 14722#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base)))), 14723#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 14724#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 14725#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 14726#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~new.base |__list_add_#in~new.base|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 14727#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~next.base| __list_add_~next.base) (= 1 (select |#valid| |__list_add_#in~next.base|)) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 14728#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= 1 (select |#valid| |__list_add_#in~next.base|)) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base))), 14729#(or (and (= 1 (select |#valid| |__list_add_#in~next.base|)) (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|)) (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|)), 14730#(or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|)))) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)), 14731#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= |~#gl_list.base| gl_insert_~node~1.base)))), 14732#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.offset| 0)) (and (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|)))), 14733#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 14734#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= |~#gl_list.offset| 0)), 14735#(and (= 0 |inspect_#in~head.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4))))), 14736#(and (= inspect_~head.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))))), 14737#(= 1 (select |#valid| |inspect_#t~mem2.base|)), 14738#(= 1 (select |#valid| inspect_~head.base)), 14701#true, 14702#false, 14703#(= |~#gl_list.offset| 0), 14704#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 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|))), 14705#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14706#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14707#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14708#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|)), 14709#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14710#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 14711#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 14712#(and (or (not (= __list_add_~next.offset 0)) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base)))) (not (= __list_add_~prev.offset 0))) (= __list_add_~prev.base |__list_add_#in~prev.base|))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 14713#(and (or (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (= __list_add_~new.base (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (not (= __list_add_~next.base __list_add_~prev.base)))) (= __list_add_~next.base __list_add_~new.base))) (not (= __list_add_~prev.offset 0)))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 14714#(or (not (= |__list_add_#in~next.offset| 0)) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (or (not (= __list_add_~prev.offset 0)) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (= __list_add_~new.base (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4)))) (= |__list_add_#in~new.base| __list_add_~new.base))) (= __list_add_~prev.base |__list_add_#in~prev.base|))), 14715#(or (not (= |__list_add_#in~next.offset| 0)) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4)))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (not (= |__list_add_#in~prev.offset| 0))), 14716#(or (and (or (not (= |list_add_#in~head.offset| 0)) (and (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (or (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4))) (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|))))) (= (select |#valid| |list_add_#in~head.base|) 1)) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))), 14717#(and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (= |~#gl_list.base| gl_insert_~node~1.base) (and (= (select |#valid| |~#gl_list.base|) 1) (or (and (or (= (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))) (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.offset| 0)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)))), 14718#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (= (select |#valid| |~#gl_list.base|) 1) (or (not (= |~#gl_list.offset| 0)) (and (or (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))))), 14719#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))] [2018-02-02 20:42:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:02,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 20:42:02,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 20:42:02,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:42:02,758 INFO L87 Difference]: Start difference. First operand 452 states and 511 transitions. Second operand 38 states. [2018-02-02 20:42:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:06,993 INFO L93 Difference]: Finished difference Result 646 states and 723 transitions. [2018-02-02 20:42:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:42:06,993 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 91 [2018-02-02 20:42:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:06,994 INFO L225 Difference]: With dead ends: 646 [2018-02-02 20:42:06,994 INFO L226 Difference]: Without dead ends: 646 [2018-02-02 20:42:06,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=493, Invalid=4477, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 20:42:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-02-02 20:42:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 562. [2018-02-02 20:42:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-02-02 20:42:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 650 transitions. [2018-02-02 20:42:07,005 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 650 transitions. Word has length 91 [2018-02-02 20:42:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:07,006 INFO L432 AbstractCegarLoop]: Abstraction has 562 states and 650 transitions. [2018-02-02 20:42:07,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 20:42:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 650 transitions. [2018-02-02 20:42:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 20:42:07,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:07,007 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:07,007 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash 935805703, now seen corresponding path program 1 times [2018-02-02 20:42:07,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:07,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:08,042 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-02-02 20:42:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:42:09,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:09,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:42:09,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:42:09,452 INFO L182 omatonBuilderFactory]: Interpolants [16014#true, 16015#false, 16016#(= |~#gl_list.offset| 0), 16017#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 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|))), 16018#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16019#(and (= 0 |gl_insert_#t~malloc24.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16020#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= gl_insert_~node~1.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16021#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|) (= gl_insert_~node~1.offset 0)), 16022#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16023#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 16024#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 16025#(and (or (not (= __list_add_~next.offset 0)) (and (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (= __list_add_~next.base __list_add_~new.base)))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 16026#(and (or (not (= __list_add_~next.offset 0)) (and (or (and (or (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) __list_add_~new.offset __list_add_~next.offset)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (= (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4)) __list_add_~new.base)) (not (= __list_add_~next.base __list_add_~prev.base))) (<= |__list_add_#in~new.offset| __list_add_~new.offset) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (= __list_add_~next.base __list_add_~new.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 16027#(or (not (= |__list_add_#in~next.offset| 0)) (and (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset)) __list_add_~prev.base) (+ (- 0) 4))) (= (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4)) __list_add_~new.base))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= __list_add_~prev.offset 0))) (= |__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|))), 16028#(or (not (= |__list_add_#in~next.offset| 0)) (and (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (or (and (= (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|) (+ (- 0) 4))) (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|))) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)) (not (= |__list_add_#in~prev.offset| 0))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)))), 16029#(or (and (or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (and (or (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (+ (- 0) 4))))) (<= |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|)) (not (= |list_add_#in~head.offset| 0))) (= (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|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))), 16030#(and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (= |~#gl_list.base| gl_insert_~node~1.base) (not (= |~#gl_list.offset| 0)) (and (= (select |#valid| |~#gl_list.base|) 1) (or (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (and (= 20 (select |#length| gl_insert_~node~1.base)) (<= (+ gl_insert_~node~1.offset 4) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|)) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)))) (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ gl_insert_~node~1.offset 4)))) (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (= gl_insert_~node~1.offset 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)))), 16031#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (= (select |#valid| |~#gl_list.base|) 1) (or (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) (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 16032#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16033#(and (= (store |old(#length)| |gl_insert_#t~malloc24.base| (select |#length| |gl_insert_#t~malloc24.base|)) |#length|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16034#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (or (= 20 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16035#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (or (= 20 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|)), 16036#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16037#(and (= |list_add_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16038#(and (= __list_add_~next.offset |__list_add_#in~next.offset|) (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 16039#(and (= __list_add_~next.offset |__list_add_#in~next.offset|) (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~next.base| __list_add_~next.base) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~next.base __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (not (= (select |#length| __list_add_~next.base) 20)))), 16040#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (or (not (= (select |#length| |__list_add_#in~next.base|) 20)) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 16041#(or (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (not (= (select |#length| |__list_add_#in~next.base|) 20)) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (and (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|)) (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|))))) (or (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|))) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|))))), 16042#(or (and (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|))) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|)))) (= |list_add_#in~new.base| |list_add_#in~head.base|) (not (= (select |#length| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) 20)) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)), 16043#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (and (or (not (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) 20)) (<= (+ |~#gl_list.offset| 5) (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (<= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 3)) (and (or (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)))) (= 20 (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (not (= |~#gl_list.base| gl_insert_~node~1.base)))), 16044#(or (not (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) 20)) (and (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= 20 (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= 0 (select |old(#valid)| |~#gl_list.base|)) (<= (+ |~#gl_list.offset| 5) (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (<= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 3))), 16045#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) 4))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) 4) 4) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) 4))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 16046#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) 4))) (= |~#gl_list.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) 4) 4) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) 4))), 16047#(and (= 0 |inspect_#in~head.offset|) (<= (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) 4) 4) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) 4))) (<= 4 (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) 4))), 16048#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (<= 4 (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4))) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 16049#(and (<= 4 |inspect_#t~mem2.offset|) (<= |inspect_#t~mem2.offset| 4) (= 20 (select |#length| |inspect_#t~mem2.base|))), 16050#(and (<= inspect_~head.offset 4) (= (select |#length| inspect_~head.base) 20) (<= 4 inspect_~head.offset))] [2018-02-02 20:42:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:42:09,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 20:42:09,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 20:42:09,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1211, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:42:09,453 INFO L87 Difference]: Start difference. First operand 562 states and 650 transitions. Second operand 37 states. [2018-02-02 20:42:10,512 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 106 DAG size of output 98 [2018-02-02 20:42:10,813 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 94 DAG size of output 92 [2018-02-02 20:42:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:15,432 INFO L93 Difference]: Finished difference Result 661 states and 737 transitions. [2018-02-02 20:42:15,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:42:15,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 91 [2018-02-02 20:42:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:15,434 INFO L225 Difference]: With dead ends: 661 [2018-02-02 20:42:15,434 INFO L226 Difference]: Without dead ends: 661 [2018-02-02 20:42:15,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=581, Invalid=4111, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 20:42:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-02-02 20:42:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 562. [2018-02-02 20:42:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-02-02 20:42:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 647 transitions. [2018-02-02 20:42:15,445 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 647 transitions. Word has length 91 [2018-02-02 20:42:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:15,445 INFO L432 AbstractCegarLoop]: Abstraction has 562 states and 647 transitions. [2018-02-02 20:42:15,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 20:42:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 647 transitions. [2018-02-02 20:42:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-02-02 20:42:15,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:15,447 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:15,447 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1144763239, now seen corresponding path program 1 times [2018-02-02 20:42:15,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:15,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:17,496 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-02-02 20:42:17,669 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 78 DAG size of output 66 [2018-02-02 20:42:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:42:18,295 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:18,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 20:42:18,295 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:42:18,296 INFO L182 omatonBuilderFactory]: Interpolants [17344#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17345#(and (= 0 |gl_insert_#t~malloc24.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17346#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= gl_insert_~node~1.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17347#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|) (= gl_insert_~node~1.offset 0)), 17348#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17349#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 17350#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 17351#(and (or (and (= |__list_add_#in~new.base| __list_add_~new.base) (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (= __list_add_~next.base __list_add_~new.base)) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 17352#(and (or (and (or (= __list_add_~next.base __list_add_~new.base) (and (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) __list_add_~new.offset __list_add_~next.offset)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (= __list_add_~new.base (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= __list_add_~next.base __list_add_~prev.base))) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)))) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 17353#(or (not (= |__list_add_#in~next.offset| 0)) (and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= 4 |__list_add_#in~prev.offset|) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset)) __list_add_~prev.base) (+ (- 0) 4))) (= __list_add_~new.base (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (= __list_add_~prev.base |__list_add_#in~prev.base|))), 17354#(or (not (= |__list_add_#in~next.offset| 0)) (and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= 4 |__list_add_#in~prev.offset|) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= (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|) (+ (- 0) 4))) (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4))) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|))))), 17355#(and (or (and (or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (= 4 |list_add_#in~head.offset|) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4))) (= (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|) (+ (- 0) 4))) (<= (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|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))) (= (select |#valid| |list_add_#in~head.base|) 1)), 17356#(and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (and (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (or (and (or (and (= (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ gl_insert_~node~1.offset 4))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))) (= 20 (select |#length| gl_insert_~node~1.base)) (= gl_insert_~node~1.offset 0)) (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (= |~#gl_list.base| gl_insert_~node~1.base) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0))) (= (select |#valid| |~#gl_list.base|) 1)), 17357#(and (= (select |#valid| |~#gl_list.base|) 1) (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (or (and (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 4) (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))))), 17358#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17359#(and (= (store |old(#length)| |gl_insert_#t~malloc24.base| (select |#length| |gl_insert_#t~malloc24.base|)) |#length|) (= 0 |gl_insert_#t~malloc24.offset|) (= (select |#length| |gl_insert_#t~malloc24.base|) 20) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17360#(and (or (= (select |#length| (@diff |old(#length)| |#length|)) 20) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= gl_insert_~node~1.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17361#(and (or (= (select |#length| (@diff |old(#length)| |#length|)) 20) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|) (= gl_insert_~node~1.offset 0)), 17362#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17363#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17364#(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_#in~next.base| __list_add_~next.base) (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (= __list_add_~new.offset 0))) (= __list_add_~new.base __list_add_~prev.base))), 17365#(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_#in~next.base| __list_add_~next.base) (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= __list_add_~new.offset 0) (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~next.base __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (= __list_add_~new.base __list_add_~prev.base))), 17366#(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_#in~new.offset| __list_add_~new.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= |__list_add_#in~next.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= __list_add_~new.offset 0) (and (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (or (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= |__list_add_#in~next.base| __list_add_~prev.base)) (<= __list_add_~new.offset |__list_add_#in~new.offset|)))) (= __list_add_~new.base __list_add_~prev.base))), 17367#(or (and (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (= (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) |__list_add_#in~prev.offset|) (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|))) (= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|) (or (= (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)) |__list_add_#in~prev.offset|) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|))) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)))))) (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (<= |__list_add_#in~new.offset| 0)), 17368#(or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~new.offset|) (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|)) (= (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|)) |list_add_#in~head.offset|)) (or (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) |list_add_#in~head.offset|))) (<= |list_add_#in~new.offset| 0) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)), 17369#(and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (or (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|)) (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) |~#gl_list.offset|))) (= 20 (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) |~#gl_list.offset|)) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|))) (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (or (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|)) (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) |~#gl_list.offset|))) (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) |~#gl_list.offset|)) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= gl_insert_~node~1.base |~#gl_list.base|)))) (= gl_insert_~node~1.offset 0)), 17370#(and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (or (= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) |~#gl_list.offset|) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (or (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) |~#gl_list.offset|)) (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|))) (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (and (or (= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) |~#gl_list.offset|) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (= 20 (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (or (and (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) |~#gl_list.offset|)) (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|))))) (not (= gl_insert_~node~1.base |~#gl_list.base|))) (not (= |~#gl_list.offset| 0))) (= gl_insert_~node~1.offset 0)), 17371#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= 20 (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (or (and (= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) |~#gl_list.offset|) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (or (and (= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) |~#gl_list.offset|) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4)) (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (or (and (= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) |~#gl_list.offset|) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (or (and (= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) |~#gl_list.offset|) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (+ |~#gl_list.offset| 4))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|)))), 17372#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (and (not (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) 0)) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4))), 17373#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= |~#gl_list.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4) (not (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.offset|))), 17374#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4)))) (<= (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)) 4) (= 0 |inspect_#in~head.offset|) (not (= (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) |inspect_#in~head.offset|) |inspect_#in~head.offset|))), 17375#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (not (= (select (select |#memory_$Pointer$.offset| inspect_~head.base) inspect_~head.offset) inspect_~head.offset)) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 17376#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (not (= (select (select |#memory_$Pointer$.offset| inspect_~head.base) inspect_~head.offset) inspect_~head.offset)) (= |inspect_#t~mem0.offset| (select (select |#memory_$Pointer$.offset| inspect_~head.base) inspect_~head.offset)) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 17377#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 17378#(and (<= |inspect_#t~mem2.offset| 4) (= 20 (select |#length| |inspect_#t~mem2.base|))), 17379#(and (<= inspect_~head.offset 4) (= 20 (select |#length| inspect_~head.base))), 17380#(and (<= inspect_~head.offset 4) (<= 0 inspect_~head.offset) (= 20 (select |#length| inspect_~head.base))), 17381#(and (<= 0 (+ inspect_~node~0.offset 4)) (<= inspect_~node~0.offset 0) (= (select |#length| inspect_~node~0.base) 20)), 17340#true, 17341#false, 17342#(= |~#gl_list.offset| 0), 17343#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 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|)))] [2018-02-02 20:42:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:42:18,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 20:42:18,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 20:42:18,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1612, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:42:18,297 INFO L87 Difference]: Start difference. First operand 562 states and 647 transitions. Second operand 42 states. [2018-02-02 20:42:19,382 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 83 DAG size of output 81 [2018-02-02 20:42:19,744 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 103 DAG size of output 96 [2018-02-02 20:42:20,110 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-02-02 20:42:20,344 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 72 DAG size of output 71 [2018-02-02 20:42:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:27,501 INFO L93 Difference]: Finished difference Result 676 states and 768 transitions. [2018-02-02 20:42:27,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:42:27,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 103 [2018-02-02 20:42:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:27,503 INFO L225 Difference]: With dead ends: 676 [2018-02-02 20:42:27,503 INFO L226 Difference]: Without dead ends: 676 [2018-02-02 20:42:27,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=451, Invalid=4805, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:42:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-02-02 20:42:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 580. [2018-02-02 20:42:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-02-02 20:42:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 669 transitions. [2018-02-02 20:42:27,511 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 669 transitions. Word has length 103 [2018-02-02 20:42:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:27,511 INFO L432 AbstractCegarLoop]: Abstraction has 580 states and 669 transitions. [2018-02-02 20:42:27,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 20:42:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 669 transitions. [2018-02-02 20:42:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 20:42:27,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:27,512 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:27,512 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1172399549, now seen corresponding path program 2 times [2018-02-02 20:42:27,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:27,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:30,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:30,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 20:42:30,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:30,044 INFO L182 omatonBuilderFactory]: Interpolants [18701#true, 18702#false, 18703#(= |~#gl_list.offset| 0), 18704#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)), 18705#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) |~#gl_list.base|) (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))), 18706#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18707#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|))), 18708#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18709#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base)))), 18710#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18711#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 18712#(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_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 18713#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18714#(and (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (and (= __list_add_~next.base |__list_add_#in~next.base|) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (= (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4)) __list_add_~new.base)) (= (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (store (select |old(#memory_$Pointer$.base)| __list_add_~next.base) (+ __list_add_~next.offset 4) (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))))) (not (= __list_add_~next.base __list_add_~prev.base)))) (= __list_add_~next.base __list_add_~new.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 18715#(and (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (= (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base)) (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base))))) (or (= __list_add_~prev.offset (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base))) (= (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base))) __list_add_~new.base) (= (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|)))) (= |__list_add_#in~new.base| |__list_add_#in~next.base|))), 18716#(or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (<= (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) 0) (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|)) (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) 0) (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~next.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (not (= |__list_add_#in~prev.offset| 0))), 18717#(and (or (not (= |list_add_#in~head.offset| 0)) (and (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (and (or (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) 0)) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (store (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))))) (or (<= (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) 0) (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))))))))) (= (select |#valid| |list_add_#in~head.base|) 1)), 18718#(and (= (select |#valid| |~#gl_list.base|) 1) (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (not (= |~#gl_list.offset| 0)) (and (or (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))) (not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|))))) (not (= |~#gl_list.base| gl_insert_~node~1.base))))), 18719#(and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (and (or (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))) (= (select |#valid| |~#gl_list.base|) 1)), 18720#(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_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (= __list_add_~new.base __list_add_~prev.base))), 18721#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (and (= 1 (select |#valid| __list_add_~next.base)) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|)) (= __list_add_~new.base __list_add_~prev.base))), 18722#(and (or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= __list_add_~new.base __list_add_~prev.base))) (or (and (= 1 (select |#valid| |__list_add_#in~next.base|)) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= |__list_add_#in~next.base| __list_add_~prev.base))) (= __list_add_~new.base __list_add_~prev.base))), 18723#(or (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (and (not (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~prev.base|)) (or (and (= 1 (select |#valid| |__list_add_#in~next.base|)) (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|)) (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (not (= |__list_add_#in~prev.offset| 0))))), 18724#(and (or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (or (and (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|)))) (not (= |list_add_#in~head.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (not (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)))) (= (select |#valid| |list_add_#in~head.base|) 1)), 18725#(and (= (select |#valid| |~#gl_list.base|) 1) (or (and (or (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (not (= gl_insert_~node~1.base |~#gl_list.base|))) (= 0 (select |old(#valid)| |~#gl_list.base|)))), 18726#(and (= (select |#valid| |~#gl_list.base|) 1) (or (and (or (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (= 1 (select |#valid| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (not (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))) (= 0 (select |old(#valid)| |~#gl_list.base|)))), 18727#(and (= (select |#valid| |~#gl_list.base|) 1) (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (not (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4))))))), 18728#(and (= |#valid| (store |old(#valid)| |gl_insert_#t~malloc24.base| (select |#valid| |gl_insert_#t~malloc24.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|))), 18729#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |#valid| |old(#valid)|) (= gl_insert_~node~1.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 18730#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= (select |#valid| gl_insert_~node~1.base) 1) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 18731#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 18732#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= |__list_add_#in~new.base| __list_add_~new.base) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 18733#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= __list_add_~prev.base |__list_add_#in~next.base|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 18734#(or (= |__list_add_#in~prev.base| |__list_add_#in~next.base|) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (and (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (or (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|)) (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (not (= |__list_add_#in~prev.offset| 0))), 18735#(and (or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|)))) (not (= |list_add_#in~head.offset| 0)) (= |list_add_#in~head.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|))) (= 1 (select |#valid| |list_add_#in~head.base|))), 18736#(and (or (= gl_insert_~node~1.base |~#gl_list.base|) (and (= 1 (select |#valid| |~#gl_list.base|)) (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= (select |#valid| gl_insert_~node~1.base) 1) (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.offset| 0))))) (= 0 (select |old(#valid)| gl_insert_~node~1.base))), 18737#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (or (= gl_insert_~node~1.base |~#gl_list.base|) (and (= 1 (select |#valid| |~#gl_list.base|)) (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (and (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|))) (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= |~#gl_list.offset| 0)))))), 18738#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= 1 (select |#valid| |~#gl_list.base|)) (or (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= |~#gl_list.offset| 0)) (and (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))))), 18739#(or (and (= 1 (select |#valid| |~#gl_list.base|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4))))) (= 0 (select |old(#valid)| |~#gl_list.base|))), 18740#(and (= 1 (select |#valid| |~#gl_list.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= |~#gl_list.offset| 0)), 18741#(and (= 0 |inspect_#in~head.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4)))) (= 1 (select |#valid| |inspect_#in~head.base|))), 18742#(and (= inspect_~head.offset 0) (= 1 (select |#valid| inspect_~head.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))))), 18743#(and (= inspect_~head.offset 0) (= |inspect_#t~mem1.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))) (= 1 (select |#valid| inspect_~head.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))))), 18744#(and (= inspect_~head.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))))), 18745#(= 1 (select |#valid| |inspect_#t~mem2.base|)), 18746#(= 1 (select |#valid| inspect_~head.base))] [2018-02-02 20:42:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:42:30,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 20:42:30,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 20:42:30,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1923, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:42:30,045 INFO L87 Difference]: Start difference. First operand 580 states and 669 transitions. Second operand 46 states. [2018-02-02 20:42:31,628 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 85 DAG size of output 67 [2018-02-02 20:42:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:37,596 INFO L93 Difference]: Finished difference Result 682 states and 756 transitions. [2018-02-02 20:42:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:42:37,597 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-02-02 20:42:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:37,598 INFO L225 Difference]: With dead ends: 682 [2018-02-02 20:42:37,598 INFO L226 Difference]: Without dead ends: 682 [2018-02-02 20:42:37,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1591 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=677, Invalid=6463, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 20:42:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-02-02 20:42:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 585. [2018-02-02 20:42:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-02-02 20:42:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 674 transitions. [2018-02-02 20:42:37,608 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 674 transitions. Word has length 121 [2018-02-02 20:42:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:37,608 INFO L432 AbstractCegarLoop]: Abstraction has 585 states and 674 transitions. [2018-02-02 20:42:37,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 20:42:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 674 transitions. [2018-02-02 20:42:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 20:42:37,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:37,609 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:37,610 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1172399550, now seen corresponding path program 2 times [2018-02-02 20:42:37,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:37,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:41,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:42:41,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 20:42:41,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:41,327 INFO L182 omatonBuilderFactory]: Interpolants [20096#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20097#(and (= 0 |gl_insert_#t~malloc24.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 20 (select |#length| |gl_insert_#t~malloc24.base|)) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20098#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= gl_insert_~node~1.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20099#(and (= 20 (select |#length| gl_insert_~node~1.base)) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= (select |#valid| gl_insert_~node~1.base) 1) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|) (= gl_insert_~node~1.offset 0)), 20100#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20101#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 20102#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (<= |list_add_#in~new.offset| list_add_~new.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |#valid| |list_add_#in~head.base|) 1) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 20103#(and (or (and (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (= __list_add_~next.base __list_add_~new.base)) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|)) (not (= __list_add_~next.offset 0))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 20104#(and (or (not (= __list_add_~next.offset 0)) (and (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|) (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) __list_add_~new.offset __list_add_~next.offset)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4)) __list_add_~new.base) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (not (= __list_add_~next.base __list_add_~prev.base)))) (= __list_add_~next.base __list_add_~new.base)))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 20105#(and (or (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (<= 4 |__list_add_#in~prev.offset|) (and (<= |__list_add_#in~new.offset| __list_add_~new.offset) (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset)) __list_add_~prev.base) (+ (- 0) 4))) (= __list_add_~new.base (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4))) (<= __list_add_~new.offset |__list_add_#in~new.offset|))) (= __list_add_~prev.offset |__list_add_#in~prev.offset|) (= __list_add_~new.base |__list_add_#in~new.base|)) (not (= |__list_add_#in~next.offset| 0))) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 20106#(or (not (= |__list_add_#in~next.offset| 0)) (and (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (+ (- 0) 4))) (<= |__list_add_#in~new.offset| (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|)) (= (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4))) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|) |__list_add_#in~new.offset|)) (<= 4 |__list_add_#in~prev.offset|)))), 20107#(or (and (or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (<= 4 |list_add_#in~head.offset|) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (and (= (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4))) (= (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|) (+ (- 0) 4))) (<= |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|))) (= (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|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))), 20108#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (and (or (and (= (select |#valid| gl_insert_~node~1.base) 1) (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (or (and (= 20 (select |#length| gl_insert_~node~1.base)) (<= (+ gl_insert_~node~1.offset 4) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (<= (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) |~#gl_list.offset|) (+ gl_insert_~node~1.offset 4)) (= (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)) (= gl_insert_~node~1.offset 0)) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= |~#gl_list.offset| 0))) (= (select |#valid| |~#gl_list.base|) 1) (not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0))) (not (= |~#gl_list.base| gl_insert_~node~1.base)))), 20109#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (or (not (= |~#gl_list.offset| 0)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) 1) (or (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) (= (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)) (= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) |~#gl_list.offset|) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))))) (= (select |#valid| |~#gl_list.base|) 1) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))))), 20110#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20111#(and (= (store |old(#length)| |gl_insert_#t~malloc24.base| (select |#length| |gl_insert_#t~malloc24.base|)) |#length|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20112#(and (or (= gl_insert_~node~1.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20113#(and (or (= gl_insert_~node~1.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|)), 20114#(and (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20115#(and (= |list_add_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset)) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= (select |#valid| list_add_~head.base) 1) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20116#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~next.base |__list_add_#in~next.base|) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (not (= __list_add_~prev.offset 0)))), 20117#(and (or (and (= __list_add_~next.offset |__list_add_#in~next.offset|) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)))) (not (= __list_add_~prev.offset 0))) (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~next.base |__list_add_#in~next.base|) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~next.base __list_add_~prev.base)) (= __list_add_~new.base |__list_add_#in~new.base|) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 20118#(and (or (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base) (not (= __list_add_~prev.offset 0))) (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= __list_add_~new.base |__list_add_#in~new.base|) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 20119#(or (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) 0) (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|))) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)) 0) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|))) (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|))))) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) |__list_add_#in~prev.offset|))) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= |__list_add_#in~prev.offset| 0))), 20120#(or (= |list_add_#in~new.base| |list_add_#in~head.base|) (and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) 0) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|)) 0) (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|))) (not (= |list_add_#in~head.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) |list_add_#in~head.offset|)))) (not (= |list_add_#in~head.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (= (select |#valid| |list_add_#in~head.base|) 1))), 20121#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (or (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) 0) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) 0)) (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) |~#gl_list.offset|)))) (and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)))) (= (select |#valid| |~#gl_list.base|) 1) (not (= |~#gl_list.base| gl_insert_~node~1.base)))), 20122#(or (and (= (select |#valid| |~#gl_list.base|) 1) (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) 0) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (= (select |old(#length)| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (select |#length| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|))) (or (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) 0)) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|))))) (= 0 (select |old(#valid)| |~#gl_list.base|))), 20123#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (and (= (select |#valid| |~#gl_list.base|) 1) (or (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (not (= |~#gl_list.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) |~#gl_list.offset|)))) (not (= |~#gl_list.offset| 0)) (not (= |~#gl_list.base| (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0))), 20124#(and (= (store |old(#length)| |gl_insert_#t~malloc24.base| (select |#length| |gl_insert_#t~malloc24.base|)) |#length|) (= (select |#length| |gl_insert_#t~malloc24.base|) 20) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20125#(and (or (= (select |#length| (@diff |old(#length)| |#length|)) 20) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20126#(and (or (= (select |#length| (@diff |old(#length)| |#length|)) 20) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|)), 20127#(and (= (select (select |#memory_$Pointer$.base| list_add_~head.base) |list_add_#in~head.offset|) |list_add_#t~mem21.base|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20128#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~next.base| __list_add_~next.base) (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 20129#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~next.base| __list_add_~next.base) (or (= __list_add_~next.base __list_add_~prev.base) (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base))) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~next.base __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|)), 20130#(and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (= |__list_add_#in~new.base| __list_add_~new.base) (or (= (select |#memory_$Pointer$.offset| __list_add_~prev.base) (select |old(#memory_$Pointer$.offset)| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base)) (= __list_add_~prev.base |__list_add_#in~prev.base|) (or (= (select |old(#memory_$Pointer$.base)| __list_add_~prev.base) (select |#memory_$Pointer$.base| __list_add_~prev.base)) (= __list_add_~new.base __list_add_~prev.base) (= |__list_add_#in~next.base| __list_add_~prev.base))), 20131#(or (and (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|))))) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (store (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|)) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|))))) (or (= (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|)) (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.base)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|)))) (or (= |__list_add_#in~prev.offset| (@diff (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|) (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|))) (= (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (select |old(#memory_$Pointer$.offset)| |__list_add_#in~prev.base|)))) (= |__list_add_#in~next.base| |__list_add_#in~prev.base|) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|)), 20132#(or (and (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)))) (select |#memory_$Pointer$.base| |list_add_#in~head.base|)) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) (select |#memory_$Pointer$.base| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|))) (or (= |list_add_#in~head.offset| (@diff (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) (select |#memory_$Pointer$.offset| |list_add_#in~head.base|))) (= (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|)))) (= |list_add_#in~new.base| |list_add_#in~head.base|) (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)), 20133#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (or (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|) (and (or (= (select |#length| (@diff |old(#length)| |#length|)) 20) (= |old(#length)| |#length|)) (or (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (= (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)) (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|)))) (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|))) (= gl_insert_~node~1.base |~#gl_list.base|))), 20134#(or (and (or (= (select |#length| (@diff |old(#length)| |#length|)) 20) (= |old(#length)| |#length|)) (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|))) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |~#gl_list.offset| (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= (select |#memory_$Pointer$.base| |~#gl_list.base|) (select |old(#memory_$Pointer$.base)| |~#gl_list.base|))) (= (select |#memory_$Pointer$.offset| |~#gl_list.base|) (store (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|)) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) (select |#memory_$Pointer$.offset| |~#gl_list.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)) (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (@diff (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) (select |#memory_$Pointer$.base| |~#gl_list.base|)))) (select |#memory_$Pointer$.base| |~#gl_list.base|))) (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)), 20135#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 20136#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (<= (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)) 4) (= |~#gl_list.offset| 0) (<= 4 (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))), 20137#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4)))) (<= (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)) 4) (= 0 |inspect_#in~head.offset|) (<= 4 (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)))), 20138#(and (= inspect_~head.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4)))) (<= 4 (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4))) (<= (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)) 4)), 20139#(and (<= 4 |inspect_#t~mem2.offset|) (<= |inspect_#t~mem2.offset| 4) (= 20 (select |#length| |inspect_#t~mem2.base|))), 20140#(and (<= inspect_~head.offset 4) (= (select |#length| inspect_~head.base) 20) (<= 4 inspect_~head.offset)), 20092#true, 20093#false, 20094#(= |~#gl_list.offset| 0), 20095#(and (= (select |#valid| |~#gl_list.base|) 1) (= 0 |~#gl_list.offset|) (= 0 (select (store (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.offset|) |~#gl_list.offset|)) (= (select (store (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4) |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))] [2018-02-02 20:42:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:42:41,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 20:42:41,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 20:42:41,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:42:41,329 INFO L87 Difference]: Start difference. First operand 585 states and 674 transitions. Second operand 49 states. [2018-02-02 20:42:42,535 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 82 DAG size of output 68 [2018-02-02 20:42:42,984 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 112 DAG size of output 99 [2018-02-02 20:42:43,439 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 109 DAG size of output 98 [2018-02-02 20:42:43,783 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 92 DAG size of output 82 [2018-02-02 20:42:49,131 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 82 DAG size of output 75 [2018-02-02 20:42:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:50,851 INFO L93 Difference]: Finished difference Result 829 states and 945 transitions. [2018-02-02 20:42:50,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:42:50,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 121 [2018-02-02 20:42:50,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:50,853 INFO L225 Difference]: With dead ends: 829 [2018-02-02 20:42:50,853 INFO L226 Difference]: Without dead ends: 829 [2018-02-02 20:42:50,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=725, Invalid=6585, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 20:42:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-02-02 20:42:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 695. [2018-02-02 20:42:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-02-02 20:42:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 810 transitions. [2018-02-02 20:42:50,865 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 810 transitions. Word has length 121 [2018-02-02 20:42:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:50,865 INFO L432 AbstractCegarLoop]: Abstraction has 695 states and 810 transitions. [2018-02-02 20:42:50,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 20:42:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 810 transitions. [2018-02-02 20:42:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:42:50,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:50,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:50,866 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1866025993, now seen corresponding path program 1 times [2018-02-02 20:42:50,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:50,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:42:51,482 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 75 DAG size of output 63 [2018-02-02 20:42:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:52,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:42:52,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-02-02 20:42:52,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:42:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:52,084 INFO L182 omatonBuilderFactory]: Interpolants [21760#(or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4))))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))), 21761#(and (= |~#gl_list.offset| 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (select (select |#memory_$Pointer$.offset| |~#gl_list.base|) (+ |~#gl_list.offset| 4)))))), 21762#(and (= 0 |inspect_#in~head.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |inspect_#in~head.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |inspect_#in~head.base|) (+ 0 4)))))), 21763#(and (= inspect_~head.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| inspect_~head.base) (+ inspect_~head.offset 4))) (select (select |#memory_$Pointer$.offset| inspect_~head.base) (+ inspect_~head.offset 4)))))), 21764#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |inspect_#t~mem2.base|) |inspect_#t~mem2.offset|))), 21765#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset))), 21766#(and (= inspect_~node~0.base inspect_~head.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~head.base) inspect_~head.offset))) (= inspect_~head.offset (+ inspect_~node~0.offset 4))), 21767#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| inspect_~node~0.base) (+ inspect_~node~0.offset 4)))), 21768#(= 1 (select |#valid| |inspect_#t~mem9.base|)), 21741#true, 21742#false, 21743#(= |~#gl_list.offset| 0), 21744#(and (= (select |#valid| |~#gl_list.base|) 1) (= |~#gl_list.offset| 0) (= 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|))), 21745#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21746#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| |gl_insert_#t~malloc24.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21747#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21748#(and (= 0 (select |old(#valid)| gl_insert_~node~1.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| gl_insert_~node~1.base (select |#memory_$Pointer$.base| gl_insert_~node~1.base))) (= (store |old(#memory_$Pointer$.offset)| gl_insert_~node~1.base (select |#memory_$Pointer$.offset| gl_insert_~node~1.base)) |#memory_$Pointer$.offset|)), 21749#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21750#(and (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 21751#(and (= (select (select |#memory_$Pointer$.offset| list_add_~head.base) list_add_~head.offset) |list_add_#t~mem21.offset|) (<= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~head.base| list_add_~head.base) (= |list_add_#in~head.offset| list_add_~head.offset) (= (select |#memory_$Pointer$.offset| list_add_~head.base) (select |old(#memory_$Pointer$.offset)| list_add_~head.base)) (= |list_add_#t~mem21.base| (select (select |#memory_$Pointer$.base| list_add_~head.base) list_add_~head.offset)) (= (select |old(#memory_$Pointer$.base)| list_add_~head.base) (select |#memory_$Pointer$.base| list_add_~head.base)) (= |list_add_#in~new.base| list_add_~new.base)), 21752#(and (or (and (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base))) (or (= __list_add_~next.base __list_add_~new.base) (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (= |__list_add_#in~new.base| __list_add_~new.base))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|)))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 21753#(and (or (and (or (and (or (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= (+ __list_add_~next.offset 4) __list_add_~prev.offset))) (= 1 (select |#valid| __list_add_~next.base)) (or (= (+ __list_add_~next.offset 4) __list_add_~prev.offset) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (= __list_add_~next.base __list_add_~prev.base)) (or (and (= __list_add_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) __list_add_~new.offset __list_add_~next.offset)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) __list_add_~new.offset __list_add_~next.base)) __list_add_~next.base) (+ __list_add_~next.offset 4))) (= __list_add_~new.base |__list_add_#in~new.base|)) (not (= __list_add_~next.base __list_add_~prev.base))))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|)) (= __list_add_~next.base __list_add_~new.base)) (or (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (not (= __list_add_~next.base __list_add_~new.base)))) (not (= __list_add_~next.offset 0))) (or (= __list_add_~next.offset 0) (= |__list_add_#in~next.offset| __list_add_~next.offset))), 21754#(or (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (not (= __list_add_~prev.offset 4)) (= 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_~new.offset (select (select (store |#memory_$Pointer$.offset| __list_add_~new.base (store (select |#memory_$Pointer$.offset| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.offset)) __list_add_~prev.base) (+ (- 0) 4))) (= __list_add_~new.base |__list_add_#in~new.base|) (= |__list_add_#in~new.base| (select (select (store |#memory_$Pointer$.base| __list_add_~new.base (store (select |#memory_$Pointer$.base| __list_add_~new.base) (+ __list_add_~new.offset 4) __list_add_~prev.base)) __list_add_~prev.base) (+ (- 0) 4)))) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0)))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|))), 21755#(or (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~next.base|) (and (or (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (and (= __list_add_~new.offset (select (store (select |#memory_$Pointer$.offset| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.offset) (+ (- 0) 4))) (= __list_add_~new.base |__list_add_#in~new.base|) (= |__list_add_#in~new.base| (select (store (select |#memory_$Pointer$.base| __list_add_~prev.base) __list_add_~prev.offset __list_add_~new.base) (+ (- 0) 4))) (= 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)))) (and (= |__list_add_#in~prev.offset| __list_add_~prev.offset) (not (= __list_add_~prev.offset 0)))) (= __list_add_~prev.base |__list_add_#in~prev.base|) (<= __list_add_~new.offset |__list_add_#in~new.offset|))), 21756#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |__list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (+ (- 0) 4))))) (<= (select (select |#memory_$Pointer$.offset| |__list_add_#in~prev.base|) (+ (- 0) 4)) |__list_add_#in~new.offset|) (= |__list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |__list_add_#in~prev.base|) (+ (- 0) 4)))) (not (= |__list_add_#in~next.base| |__list_add_#in~prev.base|)) (not (= |__list_add_#in~next.offset| 0)) (= |__list_add_#in~new.base| |__list_add_#in~prev.base|) (not (= |__list_add_#in~prev.offset| 0))), 21757#(or (= |list_add_#in~new.base| (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|)) (not (= (select (select |old(#memory_$Pointer$.base)| |list_add_#in~head.base|) |list_add_#in~head.offset|) |list_add_#in~head.base|)) (and (<= (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (+ (- 0) 4)) |list_add_#in~new.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |list_add_#in~new.base|) (select (select |#memory_$Pointer$.offset| |list_add_#in~head.base|) (+ (- 0) 4))))) (= |list_add_#in~new.base| (select (select |#memory_$Pointer$.base| |list_add_#in~head.base|) (+ (- 0) 4)))) (not (= |list_add_#in~head.offset| 0)) (not (= (select (select |old(#memory_$Pointer$.offset)| |list_add_#in~head.base|) |list_add_#in~head.offset|) 0))), 21758#(or (not (= |~#gl_list.offset| 0)) (and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (and (not (= (+ gl_insert_~node~1.offset 16) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4)))) (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) gl_insert_~node~1.base) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 12) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4)))))) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|))))), 21759#(or (not (= |~#gl_list.offset| 0)) (and (or (= 0 (select |old(#valid)| |~#gl_list.base|)) (not (= |~#gl_list.base| gl_insert_~node~1.base))) (or (and (= gl_insert_~node~1.base (select (select (store |#memory_$Pointer$.base| gl_insert_~node~1.base (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base)) |~#gl_list.base|) (+ |~#gl_list.offset| 4))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) gl_insert_~node~1.base) (select (select (store |#memory_$Pointer$.offset| gl_insert_~node~1.base (store (select |#memory_$Pointer$.offset| gl_insert_~node~1.base) (+ gl_insert_~node~1.offset 16) (+ gl_insert_~node~1.offset 12))) |~#gl_list.base|) (+ |~#gl_list.offset| 4)))))) (= gl_insert_~node~1.base (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |~#gl_list.base|) |~#gl_list.offset|) 0)) (not (= (select (select |old(#memory_$Pointer$.base)| |~#gl_list.base|) |~#gl_list.offset|) |~#gl_list.base|)))))] [2018-02-02 20:42:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:42:52,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:42:52,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:42:52,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:42:52,085 INFO L87 Difference]: Start difference. First operand 695 states and 810 transitions. Second operand 28 states. [2018-02-02 20:42:52,711 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 98 DAG size of output 80 [2018-02-02 20:42:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:42:55,351 INFO L93 Difference]: Finished difference Result 753 states and 861 transitions. [2018-02-02 20:42:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:42:55,351 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 99 [2018-02-02 20:42:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:42:55,353 INFO L225 Difference]: With dead ends: 753 [2018-02-02 20:42:55,353 INFO L226 Difference]: Without dead ends: 753 [2018-02-02 20:42:55,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=335, Invalid=2635, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:42:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-02-02 20:42:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 695. [2018-02-02 20:42:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-02-02 20:42:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 809 transitions. [2018-02-02 20:42:55,360 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 809 transitions. Word has length 99 [2018-02-02 20:42:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:42:55,361 INFO L432 AbstractCegarLoop]: Abstraction has 695 states and 809 transitions. [2018-02-02 20:42:55,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:42:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 809 transitions. [2018-02-02 20:42:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:42:55,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:42:55,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:42:55,361 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, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-02-02 20:42:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1866025992, now seen corresponding path program 1 times [2018-02-02 20:42:55,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:42:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:42:55,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:42:55,886 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:42:55,890 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:42:55,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:42:55 BoogieIcfgContainer [2018-02-02 20:42:55,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:42:55,891 INFO L168 Benchmark]: Toolchain (without parser) took 79150.41 ms. Allocated memory was 406.8 MB in the beginning and 1.3 GB in the end (delta: 914.4 MB). Free memory was 363.5 MB in the beginning and 530.9 MB in the end (delta: -167.3 MB). Peak memory consumption was 747.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:55,891 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:42:55,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.92 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:55,892 INFO L168 Benchmark]: Boogie Preprocessor took 35.64 ms. Allocated memory is still 406.8 MB. Free memory was 350.1 MB in the beginning and 347.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:55,892 INFO L168 Benchmark]: RCFGBuilder took 575.69 ms. Allocated memory is still 406.8 MB. Free memory was 347.5 MB in the beginning and 286.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:55,892 INFO L168 Benchmark]: TraceAbstraction took 78364.16 ms. Allocated memory was 406.8 MB in the beginning and 1.3 GB in the end (delta: 914.4 MB). Free memory was 285.2 MB in the beginning and 530.9 MB in the end (delta: -245.7 MB). Peak memory consumption was 668.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:42:55,893 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 406.8 MB. Free memory is still 370.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.92 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.1 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.64 ms. Allocated memory is still 406.8 MB. Free memory was 350.1 MB in the beginning and 347.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 575.69 ms. Allocated memory is still 406.8 MB. Free memory was 347.5 MB in the beginning and 286.5 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 78364.16 ms. Allocated memory was 406.8 MB in the beginning and 1.3 GB in the end (delta: 914.4 MB). Free memory was 285.2 MB in the beginning and 530.9 MB in the end (delta: -245.7 MB). Peak memory consumption was 668.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 912). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 912). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 917). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 919). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 917). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 919). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 853). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 852). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 854). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 852). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 854). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 845). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 845). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 851). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 853). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 879). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 879). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 936]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 936). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 874). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 875). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 874). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 891). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 891). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 905). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 905). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 907). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 907). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was analyzing trace of length 100 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 268 locations, 73 error locations. TIMEOUT Result, 78.3s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 57.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4814 SDtfs, 17130 SDslu, 17070 SDs, 0 SdLazy, 70536 SolverSat, 2751 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 975 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 797 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8583 ImplicationChecksByTransitivity, 30.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=695occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 66/296 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 1249 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1364 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1337 ConstructedInterpolants, 0 QuantifiedInterpolants, 3937059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 66/296 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-42-55-898.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-42-55-898.csv Completed graceful shutdown