./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:36:38,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:36:38,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:36:38,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:36:38,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:36:38,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:36:38,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:36:38,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:36:38,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:36:38,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:36:38,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:36:38,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:36:38,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:36:38,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:36:38,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:36:38,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:36:38,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:36:38,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:36:38,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:36:38,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:36:38,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:36:38,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:36:38,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:36:38,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:36:38,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:36:38,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:36:38,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:36:38,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:36:38,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:36:38,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:36:38,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:36:38,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:36:38,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:36:38,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:36:38,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:36:38,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:36:38,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:36:38,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:36:38,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:36:38,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:36:38,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:36:38,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 03:36:38,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:36:38,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:36:38,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:36:38,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:36:38,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:36:38,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:36:38,805 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:36:38,805 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:36:38,805 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:36:38,805 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:36:38,806 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:36:38,806 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:36:38,806 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:36:38,806 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:36:38,807 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:36:38,807 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:36:38,807 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:36:38,807 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:36:38,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:36:38,808 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:36:38,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:36:38,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:36:38,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:36:38,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:36:38,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:36:38,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:36:38,810 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:36:38,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:36:38,810 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:36:38,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:36:38,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:36:38,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:36:38,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:36:38,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:36:38,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:36:38,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:36:38,812 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:36:38,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:36:38,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:36:38,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:36:38,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:36:38,813 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2021-11-23 03:36:39,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:36:39,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:36:39,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:36:39,111 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:36:39,112 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:36:39,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-23 03:36:39,210 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/250e7653e/dcd359bab1004223b0c1affa142bbae0/FLAG79a03da44 [2021-11-23 03:36:39,788 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:36:39,788 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-23 03:36:39,802 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/250e7653e/dcd359bab1004223b0c1affa142bbae0/FLAG79a03da44 [2021-11-23 03:36:40,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/250e7653e/dcd359bab1004223b0c1affa142bbae0 [2021-11-23 03:36:40,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:36:40,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:36:40,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:36:40,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:36:40,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:36:40,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246e3a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40, skipping insertion in model container [2021-11-23 03:36:40,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:36:40,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:36:40,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-23 03:36:40,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:36:40,486 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:36:40,551 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-23 03:36:40,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:36:40,588 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:36:40,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40 WrapperNode [2021-11-23 03:36:40,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:36:40,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:36:40,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:36:40,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:36:40,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,650 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2021-11-23 03:36:40,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:36:40,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:36:40,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:36:40,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:36:40,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:36:40,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:36:40,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:36:40,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:36:40,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (1/1) ... [2021-11-23 03:36:40,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:36:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:36:40,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:36:40,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:36:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 03:36:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 03:36:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 03:36:40,839 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 03:36:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 03:36:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:36:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 03:36:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 03:36:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 03:36:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 03:36:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 03:36:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:36:40,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:36:40,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:36:40,981 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:36:40,988 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:36:41,351 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:36:41,444 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:36:41,444 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-23 03:36:41,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:41 BoogieIcfgContainer [2021-11-23 03:36:41,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:36:41,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:36:41,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:36:41,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:36:41,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:36:40" (1/3) ... [2021-11-23 03:36:41,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71187129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:41, skipping insertion in model container [2021-11-23 03:36:41,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:40" (2/3) ... [2021-11-23 03:36:41,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71187129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:41, skipping insertion in model container [2021-11-23 03:36:41,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:41" (3/3) ... [2021-11-23 03:36:41,457 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2021-11-23 03:36:41,464 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:36:41,464 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 03:36:41,517 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:36:41,526 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:36:41,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 03:36:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-23 03:36:41,552 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:41,553 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:41,554 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:36:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash -249418040, now seen corresponding path program 1 times [2021-11-23 03:36:41,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:36:41,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958033446] [2021-11-23 03:36:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:41,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:36:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 03:36:41,926 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:36:41,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958033446] [2021-11-23 03:36:41,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958033446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:36:41,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:36:41,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:36:41,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612876419] [2021-11-23 03:36:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:36:41,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:36:41,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:36:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:36:41,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:36:41,976 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 03:36:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:36:42,090 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2021-11-23 03:36:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:36:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-11-23 03:36:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:36:42,105 INFO L225 Difference]: With dead ends: 55 [2021-11-23 03:36:42,106 INFO L226 Difference]: Without dead ends: 26 [2021-11-23 03:36:42,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:36:42,115 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:36:42,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:36:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-23 03:36:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-23 03:36:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2021-11-23 03:36:42,191 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2021-11-23 03:36:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:36:42,192 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2021-11-23 03:36:42,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-23 03:36:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2021-11-23 03:36:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-23 03:36:42,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:42,195 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:42,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:36:42,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:36:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -436693828, now seen corresponding path program 1 times [2021-11-23 03:36:42,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:36:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061998032] [2021-11-23 03:36:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:42,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:36:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 03:36:42,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:36:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061998032] [2021-11-23 03:36:42,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061998032] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:36:42,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:36:42,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:36:42,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760816434] [2021-11-23 03:36:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:36:42,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:36:42,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:36:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:36:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:36:42,424 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-23 03:36:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:36:42,626 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2021-11-23 03:36:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:36:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-11-23 03:36:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:36:42,629 INFO L225 Difference]: With dead ends: 36 [2021-11-23 03:36:42,629 INFO L226 Difference]: Without dead ends: 25 [2021-11-23 03:36:42,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:36:42,631 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:36:42,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 48 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:36:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-23 03:36:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-11-23 03:36:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-11-23 03:36:42,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 22 [2021-11-23 03:36:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:36:42,657 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-11-23 03:36:42,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-23 03:36:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-11-23 03:36:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-23 03:36:42,659 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:42,659 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:42,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:36:42,659 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:36:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -764953388, now seen corresponding path program 1 times [2021-11-23 03:36:42,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:36:42,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395163103] [2021-11-23 03:36:42,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:42,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:36:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:36:44,375 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:36:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395163103] [2021-11-23 03:36:44,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395163103] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:36:44,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993369505] [2021-11-23 03:36:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:44,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:36:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:36:44,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:36:44,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:36:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:44,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 104 conjunts are in the unsatisfiable core [2021-11-23 03:36:44,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:36:44,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:36:45,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 03:36:45,281 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-23 03:36:45,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-23 03:36:45,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 03:36:45,583 INFO L354 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2021-11-23 03:36:45,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2021-11-23 03:36:45,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2021-11-23 03:36:45,809 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:36:45,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2021-11-23 03:36:45,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-11-23 03:36:45,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 03:36:50,276 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-23 03:36:50,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 126 [2021-11-23 03:36:50,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,302 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 03:36:50,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 79 [2021-11-23 03:36:50,332 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 03:36:50,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 94 [2021-11-23 03:36:50,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:36:50,355 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-23 03:36:50,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 61 [2021-11-23 03:36:51,100 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 03:36:51,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 198 [2021-11-23 03:36:51,121 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-23 03:36:51,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 198 [2021-11-23 03:36:51,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 164 [2021-11-23 03:36:51,179 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 03:36:51,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 149 [2021-11-23 03:36:51,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 03:36:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:36:51,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:36:51,568 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-23 03:36:51,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [867377191] [2021-11-23 03:36:51,600 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-23 03:36:51,601 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:36:51,606 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:36:51,612 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:36:51,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:36:51,668 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2aafba20 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:388) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 03:36:51,688 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:36:51,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-23 03:36:51,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491106280] [2021-11-23 03:36:51,688 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-23 03:36:51,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-23 03:36:51,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:36:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-23 03:36:51,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1237, Unknown=1, NotChecked=0, Total=1332 [2021-11-23 03:36:51,698 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 03:36:51,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=94, Invalid=1237, Unknown=1, NotChecked=0, Total=1332 [2021-11-23 03:36:51,703 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:36:51,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:36:51,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:36:51,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-23 03:36:51,922 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2aafba20 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 03:36:51,924 INFO L158 Benchmark]: Toolchain (without parser) took 11854.72ms. Allocated memory was 98.6MB in the beginning and 163.6MB in the end (delta: 65.0MB). Free memory was 64.5MB in the beginning and 132.8MB in the end (delta: -68.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:36:51,924 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 98.6MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:36:51,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.47ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 65.0MB in the end (delta: -635.5kB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2021-11-23 03:36:51,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.86ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 62.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:36:51,926 INFO L158 Benchmark]: Boogie Preprocessor took 73.75ms. Allocated memory is still 98.6MB. Free memory was 62.5MB in the beginning and 60.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:36:51,926 INFO L158 Benchmark]: RCFGBuilder took 720.92ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 60.7MB in the beginning and 95.0MB in the end (delta: -34.4MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2021-11-23 03:36:51,927 INFO L158 Benchmark]: TraceAbstraction took 10474.20ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 94.4MB in the beginning and 132.8MB in the end (delta: -38.4MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2021-11-23 03:36:51,929 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 98.6MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.47ms. Allocated memory is still 98.6MB. Free memory was 64.3MB in the beginning and 65.0MB in the end (delta: -635.5kB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.86ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 62.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.75ms. Allocated memory is still 98.6MB. Free memory was 62.5MB in the beginning and 60.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.92ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 60.7MB in the beginning and 95.0MB in the end (delta: -34.4MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10474.20ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 94.4MB in the beginning and 132.8MB in the end (delta: -38.4MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2aafba20 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2aafba20: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-23 03:36:51,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:36:54,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:36:54,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:36:54,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:36:54,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:36:54,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:36:54,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:36:54,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:36:54,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:36:54,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:36:54,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:36:54,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:36:54,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:36:54,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:36:54,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:36:54,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:36:54,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:36:54,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:36:54,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:36:54,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:36:54,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:36:54,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:36:54,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:36:54,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:36:54,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:36:54,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:36:54,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:36:54,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:36:54,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:36:54,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:36:54,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:36:54,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:36:54,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:36:54,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:36:54,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:36:54,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:36:54,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:36:54,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:36:54,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:36:54,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:36:54,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:36:54,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-23 03:36:54,852 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:36:54,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:36:54,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:36:54,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:36:54,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:36:54,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:36:54,855 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:36:54,855 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:36:54,856 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:36:54,856 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:36:54,857 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:36:54,857 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:36:54,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:36:54,859 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:36:54,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:36:54,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:36:54,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:36:54,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:36:54,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:36:54,861 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 03:36:54,861 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 03:36:54,861 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 03:36:54,861 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:36:54,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:36:54,862 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:36:54,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:36:54,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:36:54,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 03:36:54,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:36:54,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:36:54,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:36:54,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:36:54,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:36:54,864 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-23 03:36:54,864 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 03:36:54,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:36:54,864 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:36:54,865 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:36:54,865 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2021-11-23 03:36:55,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:36:55,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:36:55,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:36:55,291 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:36:55,295 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:36:55,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-23 03:36:55,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/e865f9f15/a736d43575d54f7a925fbe52297c971f/FLAG6c8053c14 [2021-11-23 03:36:56,076 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:36:56,077 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2021-11-23 03:36:56,093 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/e865f9f15/a736d43575d54f7a925fbe52297c971f/FLAG6c8053c14 [2021-11-23 03:36:56,295 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/data/e865f9f15/a736d43575d54f7a925fbe52297c971f [2021-11-23 03:36:56,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:36:56,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:36:56,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:36:56,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:36:56,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:36:56,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:56" (1/1) ... [2021-11-23 03:36:56,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52465124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:56, skipping insertion in model container [2021-11-23 03:36:56,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:56" (1/1) ... [2021-11-23 03:36:56,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:36:56,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:36:56,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-23 03:36:56,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:36:56,899 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:36:56,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2021-11-23 03:36:56,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:36:57,012 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:36:57,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57 WrapperNode [2021-11-23 03:36:57,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:36:57,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:36:57,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:36:57,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:36:57,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,080 INFO L137 Inliner]: procedures = 130, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 173 [2021-11-23 03:36:57,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:36:57,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:36:57,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:36:57,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:36:57,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:36:57,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:36:57,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:36:57,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:36:57,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2021-11-23 03:36:57,140 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:36:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:36:57,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:36:57,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:36:57,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-23 03:36:57,240 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-23 03:36:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-23 03:36:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 03:36:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:36:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 03:36:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 03:36:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 03:36:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 03:36:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-23 03:36:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 03:36:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 03:36:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:36:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:36:57,394 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:36:57,396 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:36:57,980 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:36:57,993 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:36:57,993 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-23 03:36:57,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:57 BoogieIcfgContainer [2021-11-23 03:36:57,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:36:57,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:36:57,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:36:58,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:36:58,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:36:56" (1/3) ... [2021-11-23 03:36:58,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e2fc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:58, skipping insertion in model container [2021-11-23 03:36:58,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (2/3) ... [2021-11-23 03:36:58,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e2fc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:58, skipping insertion in model container [2021-11-23 03:36:58,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:57" (3/3) ... [2021-11-23 03:36:58,009 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2021-11-23 03:36:58,015 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:36:58,015 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 03:36:58,091 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:36:58,109 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:36:58,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 03:36:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 03:36:58,140 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:58,141 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:58,141 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:36:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2021-11-23 03:36:58,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:36:58,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673557772] [2021-11-23 03:36:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:58,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:36:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:36:58,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:36:58,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 03:36:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:58,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-23 03:36:58,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:36:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:36:58,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:36:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:36:58,649 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:36:58,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673557772] [2021-11-23 03:36:58,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673557772] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:36:58,652 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:36:58,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 03:36:58,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140059795] [2021-11-23 03:36:58,655 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:36:58,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 03:36:58,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:36:58,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 03:36:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 03:36:58,693 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 03:36:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:36:58,721 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2021-11-23 03:36:58,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 03:36:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-11-23 03:36:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:36:58,734 INFO L225 Difference]: With dead ends: 77 [2021-11-23 03:36:58,734 INFO L226 Difference]: Without dead ends: 34 [2021-11-23 03:36:58,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 03:36:58,743 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:36:58,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:36:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-23 03:36:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-11-23 03:36:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2021-11-23 03:36:58,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2021-11-23 03:36:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:36:58,796 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2021-11-23 03:36:58,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-23 03:36:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2021-11-23 03:36:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-23 03:36:58,799 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:58,799 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:58,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:36:59,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:36:59,020 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:36:59,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2021-11-23 03:36:59,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:36:59,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341923982] [2021-11-23 03:36:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:59,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:36:59,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:36:59,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:36:59,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 03:36:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:59,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-23 03:36:59,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:36:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:36:59,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:36:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 03:36:59,428 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:36:59,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341923982] [2021-11-23 03:36:59,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341923982] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:36:59,430 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:36:59,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 03:36:59,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567391875] [2021-11-23 03:36:59,438 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:36:59,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:36:59,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:36:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:36:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:36:59,445 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-23 03:36:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:36:59,509 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2021-11-23 03:36:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:36:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-11-23 03:36:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:36:59,519 INFO L225 Difference]: With dead ends: 64 [2021-11-23 03:36:59,519 INFO L226 Difference]: Without dead ends: 37 [2021-11-23 03:36:59,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:36:59,522 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:36:59,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:36:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-23 03:36:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-11-23 03:36:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:36:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2021-11-23 03:36:59,535 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2021-11-23 03:36:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:36:59,536 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2021-11-23 03:36:59,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-23 03:36:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2021-11-23 03:36:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-23 03:36:59,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:36:59,539 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:36:59,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:36:59,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:36:59,753 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:36:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:36:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2021-11-23 03:36:59,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:36:59,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522581763] [2021-11-23 03:36:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:36:59,755 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:36:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:36:59,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:36:59,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 03:36:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:36:59,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:36:59,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:37:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 03:37:00,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:37:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 03:37:00,561 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:37:00,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522581763] [2021-11-23 03:37:00,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522581763] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 03:37:00,562 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:37:00,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-23 03:37:00,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290498259] [2021-11-23 03:37:00,563 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 03:37:00,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:37:00,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-23 03:37:00,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:37:00,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:37:00,565 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 03:37:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:37:00,625 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2021-11-23 03:37:00,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:37:00,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2021-11-23 03:37:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:37:00,628 INFO L225 Difference]: With dead ends: 53 [2021-11-23 03:37:00,628 INFO L226 Difference]: Without dead ends: 36 [2021-11-23 03:37:00,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:37:00,630 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:37:00,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:37:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-11-23 03:37:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-11-23 03:37:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-23 03:37:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2021-11-23 03:37:00,639 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 33 [2021-11-23 03:37:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:37:00,639 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2021-11-23 03:37:00,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-23 03:37:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2021-11-23 03:37:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-23 03:37:00,641 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:37:00,641 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:37:00,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:37:00,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 [2021-11-23 03:37:00,856 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:37:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:37:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2021-11-23 03:37:00,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-23 03:37:00,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466175780] [2021-11-23 03:37:00,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:37:00,858 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 03:37:00,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat [2021-11-23 03:37:00,859 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 03:37:00,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 03:37:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:37:01,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-23 03:37:01,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:37:01,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:37:01,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:37:01,873 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 03:37:01,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-11-23 03:37:02,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:37:02,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 03:37:02,435 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-23 03:37:02,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 62 [2021-11-23 03:37:02,470 INFO L354 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2021-11-23 03:37:02,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 52 [2021-11-23 03:37:03,005 INFO L354 Elim1Store]: treesize reduction 41, result has 8.9 percent of original size [2021-11-23 03:37:03,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 74 [2021-11-23 03:37:03,030 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:37:03,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61 [2021-11-23 03:37:03,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-11-23 03:37:03,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:37:06,096 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-23 03:37:06,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 181 treesize of output 184 [2021-11-23 03:37:06,395 INFO L354 Elim1Store]: treesize reduction 279, result has 15.2 percent of original size [2021-11-23 03:37:06,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 165 treesize of output 142 [2021-11-23 03:37:06,478 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 03:37:06,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 148 [2021-11-23 03:37:06,597 INFO L354 Elim1Store]: treesize reduction 82, result has 23.4 percent of original size [2021-11-23 03:37:06,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 105 [2021-11-23 03:37:17,233 INFO L354 Elim1Store]: treesize reduction 343, result has 9.7 percent of original size [2021-11-23 03:37:17,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 260 treesize of output 198 [2021-11-23 03:37:17,602 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-23 03:37:17,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 358 treesize of output 265 [2021-11-23 03:37:17,654 INFO L354 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2021-11-23 03:37:17,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 303 [2021-11-23 03:37:17,711 INFO L354 Elim1Store]: treesize reduction 113, result has 8.9 percent of original size [2021-11-23 03:37:17,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 300 treesize of output 228 [2021-11-23 03:37:23,092 INFO L354 Elim1Store]: treesize reduction 81, result has 4.7 percent of original size [2021-11-23 03:37:23,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 117 [2021-11-23 03:37:23,118 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-23 03:37:23,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 75 [2021-11-23 03:37:23,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-23 03:37:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:37:23,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:37:26,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_3)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-11-23 03:37:28,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_DerPreprocessor_3)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-23 03:37:30,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_3)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-23 03:37:43,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_3)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))) (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse9 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse9 v_DerPreprocessor_6))) (.cse11 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse9 v_DerPreprocessor_5)))) (let ((.cse7 (select (select .cse11 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse8 (select (select .cse13 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse5 (let ((.cse6 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse9 |v_node_create_~data#1_26|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_3))))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse10 (store .cse11 .cse7 (store (select .cse11 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse12 (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))))) is different from false [2021-11-23 03:37:45,933 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_3)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))) (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse9 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse13 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse9 v_DerPreprocessor_6))) (.cse11 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse9 v_DerPreprocessor_5)))) (let ((.cse7 (select (select .cse11 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse8 (select (select .cse13 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse5 (let ((.cse6 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse9 |v_node_create_~data#1_26|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_3))))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse10 (store .cse11 .cse7 (store (select .cse11 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse10 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse12 (store .cse13 .cse7 (store (select .cse13 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse12 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))))) is different from true [2021-11-23 03:38:12,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_1))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_2)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_8))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_9)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_7) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_3))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|))) is different from false [2021-11-23 03:38:14,487 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_1))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_2)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_8))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_9)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_7) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_3))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|))) is different from true [2021-11-23 03:39:06,840 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_29|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_1))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_3))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_4))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_2)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_2 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_8))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_9)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_29| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| v_DerPreprocessor_7) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_3))))) (store .cse9 |v_node_create_~temp~0#1.base_29| (store (select .cse9 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_29|)))) (store .cse14 |v_node_create_~temp~0#1.base_29| (store (select .cse14 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_29| (store (select .cse16 |v_node_create_~temp~0#1.base_29|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (not (bvult |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from true [2021-11-23 03:39:06,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42773 treesize of output 42177 [2021-11-23 03:39:06,943 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-23 03:39:06,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466175780] [2021-11-23 03:39:06,944 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-23 03:39:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [513565005] [2021-11-23 03:39:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:39:06,945 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-23 03:39:06,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/cvc4 [2021-11-23 03:39:06,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-23 03:39:06,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-23 03:39:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:39:07,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-23 03:39:07,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:39:07,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:39:08,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:39:10,448 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-23 03:39:10,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 34 [2021-11-23 03:39:10,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 03:39:11,268 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 03:39:11,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2021-11-23 03:39:12,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2021-11-23 03:39:12,146 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-23 03:39:12,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 64 [2021-11-23 03:39:12,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-11-23 03:39:12,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-23 03:39:13,146 INFO L354 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2021-11-23 03:39:13,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 158 [2021-11-23 03:39:13,291 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 03:39:13,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 115 [2021-11-23 03:39:13,371 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 03:39:13,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 126 [2021-11-23 03:39:13,477 INFO L354 Elim1Store]: treesize reduction 92, result has 14.0 percent of original size [2021-11-23 03:39:13,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2021-11-23 03:39:15,243 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-23 03:39:15,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 150 [2021-11-23 03:39:15,435 INFO L354 Elim1Store]: treesize reduction 156, result has 16.1 percent of original size [2021-11-23 03:39:15,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 190 [2021-11-23 03:39:15,503 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-23 03:39:15,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 249 treesize of output 152 [2021-11-23 03:39:15,956 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-23 03:39:15,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 41 [2021-11-23 03:39:15,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-11-23 03:39:16,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2021-11-23 03:39:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:39:16,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:39:18,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.base| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_13)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-11-23 03:39:40,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_13)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-23 03:39:54,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_13)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))))))) is different from false [2021-11-23 03:39:56,573 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (store |c_#memory_int| .cse10 (store (select |c_#memory_int| .cse10) .cse11 v_DerPreprocessor_13)))) (store .cse9 |c_node_create_#res#1.base| (store (select .cse9 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 (store (select |c_#memory_$Pointer$.base| .cse10) .cse11 |c_node_create_#res#1.base|)))) (store .cse12 |c_node_create_#res#1.base| (store (select .cse12 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| .cse10 (store (select |c_#memory_$Pointer$.offset| .cse10) .cse11 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse13 |c_node_create_#res#1.base| (store (select .cse13 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|))))))) is different from true [2021-11-23 03:40:23,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_2))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_18)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_13))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from false [2021-11-23 03:40:25,467 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_2))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19))) (.cse15 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_18)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_13))))) (store .cse9 |c_node_create_~temp~0#1.base| (store (select .cse9 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |c_node_create_~temp~0#1.base|)))) (store .cse14 |c_node_create_~temp~0#1.base| (store (select .cse14 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |c_node_create_~temp~0#1.base| (store (select .cse16 |c_node_create_~temp~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) is different from true [2021-11-23 03:41:30,507 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_33| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8| (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 32))) (or (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|))))) (bvult |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8| (let ((.cse4 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_6))) (.cse6 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse4 v_DerPreprocessor_5)))) (let ((.cse2 (select (select .cse6 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse3 (select (select .cse8 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_4) .cse4 |v_node_create_~data#1_26|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_3))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 v_DerPreprocessor_2))) (select (select (let ((.cse5 (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|)))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse7 (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 v_prenex_6)))) (store .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18| (store (select .cse7 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_18|) v_prenex_6 |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_12|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))))))) (= (let ((.cse13 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_19))) (.cse15 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse13 v_DerPreprocessor_18)))) (let ((.cse11 (select (select .cse15 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|)) (.cse12 (select (select .cse17 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_4|))) (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |v_node_create_~temp~0#1.base_33| (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_33|) |node_create_~temp~0#1.offset| v_DerPreprocessor_17) .cse13 |node_create_~data#1|)))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_DerPreprocessor_13))))) (store .cse9 |v_node_create_~temp~0#1.base_33| (store (select .cse9 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_12))) (select (select (let ((.cse14 (store .cse15 .cse11 (store (select .cse15 .cse11) .cse12 |v_node_create_~temp~0#1.base_33|)))) (store .cse14 |v_node_create_~temp~0#1.base_33| (store (select .cse14 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)) (bvadd (_ bv4 32) (select (select (let ((.cse16 (store .cse17 .cse11 (store (select .cse17 .cse11) .cse12 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse16 |v_node_create_~temp~0#1.base_33| (store (select .cse16 |v_node_create_~temp~0#1.base_33|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_17|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_8|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_8|))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_33|))) (not (bvult |v_node_create_~temp~0#1.base_33| |c_#StackHeapBarrier|)))) is different from true [2021-11-23 03:41:30,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226481 treesize of output 222149 [2021-11-23 03:41:30,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9204862 treesize of output 9049890 [2021-11-23 03:41:42,104 WARN L227 SmtUtils]: Spent 11.12s on a formula simplification that was a NOOP. DAG size: 2706 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-23 03:41:52,918 WARN L227 SmtUtils]: Spent 10.79s on a formula simplification that was a NOOP. DAG size: 2703 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-23 03:41:52,998 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-23 03:41:52,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443922925] [2021-11-23 03:41:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:52,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:41:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:41:53,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:41:53,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18d0427d-7cd4-4650-a123-c994c49e20b9/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 03:41:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:53,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-23 03:41:53,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:41:53,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-23 03:41:54,331 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-23 03:41:54,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-11-23 03:41:55,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 03:41:55,604 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-11-23 03:41:55,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 58 [2021-11-23 03:41:56,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-23 03:41:56,589 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-23 03:41:56,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 35 [2021-11-23 03:42:00,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:42:00,888 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:42:00,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2021-11-23 03:42:00,946 INFO L354 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2021-11-23 03:42:00,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2021-11-23 03:42:00,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 03:42:00,977 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-23 03:42:00,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2021-11-23 03:42:01,015 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-11-23 03:42:01,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 77 [2021-11-23 03:42:02,821 INFO L354 Elim1Store]: treesize reduction 152, result has 16.5 percent of original size [2021-11-23 03:42:02,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 213 treesize of output 153 [2021-11-23 03:42:02,963 INFO L354 Elim1Store]: treesize reduction 152, result has 16.5 percent of original size [2021-11-23 03:42:02,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 274 treesize of output 197 [2021-11-23 03:42:03,025 INFO L354 Elim1Store]: treesize reduction 298, result has 8.3 percent of original size [2021-11-23 03:42:03,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 159 [2021-11-23 03:42:03,524 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-23 03:42:03,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 81 [2021-11-23 03:42:03,531 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-23 03:42:03,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 47 [2021-11-23 03:42:03,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 03:42:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-23 03:42:03,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:42:23,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_25))) (.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_26)))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) v_DerPreprocessor_24) (_ bv4 32) |v_node_create_~data#1_34|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_DerPreprocessor_23))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse4 (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse4 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (let ((.cse6 (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse6 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse6 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (and (= .cse3 (_ bv0 32)) (= .cse2 (_ bv0 32))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))))) is different from false [2021-11-23 03:43:11,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_23)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (bvadd (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|) (and (= .cse2 (_ bv0 32)) (= .cse1 (_ bv0 32))) (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32))) (let ((.cse12 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_26))) (.cse10 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_25)))) (let ((.cse7 (select (select .cse10 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse8 (select (select .cse12 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (and (not (= (select (select (let ((.cse5 (let ((.cse6 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) v_DerPreprocessor_24) (_ bv4 32) |v_node_create_~data#1_34|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_23))))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (bvadd (select (select (let ((.cse11 (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|)) (or (not (= .cse7 (_ bv0 32))) (not (= .cse8 (_ bv0 32)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))))))) is different from false [2021-11-23 03:43:13,417 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12| (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_DerPreprocessor_23)))) (store .cse0 |c_node_create_#res#1.base| (store (select .cse0 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_node_create_#res#1.base|)))) (store .cse3 |c_node_create_#res#1.base| (store (select .cse3 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (bvadd (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse4 |c_node_create_#res#1.base| (store (select .cse4 |c_node_create_#res#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|) (and (= .cse2 (_ bv0 32)) (= .cse1 (_ bv0 32))) (exists ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (_ BitVec 32)) (|v_node_create_~data#1_34| (_ BitVec 32)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22| (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 32))) (let ((.cse12 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_26))) (.cse10 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_DerPreprocessor_25)))) (let ((.cse7 (select (select .cse10 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|)) (.cse8 (select (select .cse12 |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_insert_~head#1.offset_BEFORE_CALL_6|))) (and (not (= (select (select (let ((.cse5 (let ((.cse6 (store |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) (_ bv0 32) v_DerPreprocessor_24) (_ bv4 32) |v_node_create_~data#1_34|)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_DerPreprocessor_23))))) (store .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse5 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_22))) (select (select (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) .cse8 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|)))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.base_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|)) (bvadd (select (select (let ((.cse11 (store .cse12 .cse7 (store (select .cse12 .cse7) .cse8 |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28| (store (select .cse11 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_~last~1#1.offset_22|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_12|) (_ bv4 32))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_12|)) (or (not (= .cse7 (_ bv0 32))) (not (= .cse8 (_ bv0 32)))) (= (_ bv0 1) (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_28|))))))))))) is different from true