./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:23:56,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:23:56,123 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:23:56,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:23:56,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:23:56,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:23:56,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:23:56,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:23:56,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:23:56,172 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:23:56,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:23:56,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:23:56,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:23:56,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:23:56,176 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:23:56,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:23:56,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:23:56,178 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:23:56,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:23:56,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:23:56,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:23:56,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:23:56,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:23:56,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:23:56,183 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:23:56,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:23:56,184 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:23:56,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:23:56,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:23:56,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:23:56,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:23:56,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:23:56,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:23:56,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:23:56,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:23:56,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:23:56,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:23:56,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:23:56,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:23:56,192 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:23:56,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:23:56,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:23:56,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/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_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Automizer 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-23 22:23:56,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:23:56,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:23:56,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:23:56,616 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:23:56,616 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:23:56,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-23 22:24:00,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:24:00,387 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:24:00,388 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-23 22:24:00,406 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/data/072c43914/0e7708cab7c146e5bfbfac5a76d2e9b7/FLAG1daf3de16 [2023-11-23 22:24:00,424 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/data/072c43914/0e7708cab7c146e5bfbfac5a76d2e9b7 [2023-11-23 22:24:00,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:24:00,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:24:00,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:24:00,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:24:00,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:24:00,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:00" (1/1) ... [2023-11-23 22:24:00,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3286d168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:00, skipping insertion in model container [2023-11-23 22:24:00,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:24:00" (1/1) ... [2023-11-23 22:24:00,494 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:24:00,857 WARN L240 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_42b32841-2da1-4aa0-afb3-917f711f1cbb/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-23 22:24:00,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:24:00,876 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:24:00,942 WARN L240 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_42b32841-2da1-4aa0-afb3-917f711f1cbb/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-23 22:24:00,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:24:01,008 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:24:01,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01 WrapperNode [2023-11-23 22:24:01,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:24:01,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:24:01,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:24:01,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:24:01,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,075 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-11-23 22:24:01,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:24:01,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:24:01,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:24:01,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:24:01,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,105 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,133 INFO L189 HeapSplitter]: Split 25 memory accesses to 3 slices as follows [2, 14, 9] [2023-11-23 22:24:01,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:24:01,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:24:01,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:24:01,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:24:01,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (1/1) ... [2023-11-23 22:24:01,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:24:01,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:24:01,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:24:01,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:24:01,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-23 22:24:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-23 22:24:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-23 22:24:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-23 22:24:01,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-23 22:24:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-23 22:24:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-23 22:24:01,293 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-23 22:24:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 22:24:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:24:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:24:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 22:24:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 22:24:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 22:24:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 22:24:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 22:24:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 22:24:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:24:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 22:24:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 22:24:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 22:24:01,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:24:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 22:24:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 22:24:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:24:01,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:24:01,509 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:24:01,512 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:24:01,834 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:24:01,925 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:24:01,925 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-23 22:24:01,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:01 BoogieIcfgContainer [2023-11-23 22:24:01,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:24:01,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:24:01,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:24:01,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:24:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:24:00" (1/3) ... [2023-11-23 22:24:01,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174769b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:01, skipping insertion in model container [2023-11-23 22:24:01,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:24:01" (2/3) ... [2023-11-23 22:24:01,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174769b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:24:01, skipping insertion in model container [2023-11-23 22:24:01,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:24:01" (3/3) ... [2023-11-23 22:24:01,939 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-23 22:24:01,959 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:24:01,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:24:02,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:24:02,021 INFO L357 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@757ad400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:24:02,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:24:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 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) [2023-11-23 22:24:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 22:24:02,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:02,038 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:02,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:02,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2023-11-23 22:24:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770368830] [2023-11-23 22:24:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:02,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:24:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:24:02,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770368830] [2023-11-23 22:24:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770368830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:24:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:24:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:24:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799469184] [2023-11-23 22:24:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:24:02,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:24:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:24:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:24:02,679 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-23 22:24:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:02,788 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2023-11-23 22:24:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:24:02,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-11-23 22:24:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:02,801 INFO L225 Difference]: With dead ends: 54 [2023-11-23 22:24:02,801 INFO L226 Difference]: Without dead ends: 23 [2023-11-23 22:24:02,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:24:02,811 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:02,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:24:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-23 22:24:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-23 22:24:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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) [2023-11-23 22:24:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-11-23 22:24:02,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2023-11-23 22:24:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:02,866 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-11-23 22:24:02,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-23 22:24:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-11-23 22:24:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 22:24:02,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:02,870 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:02,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:24:02,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:02,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2023-11-23 22:24:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:02,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266564280] [2023-11-23 22:24:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 22:24:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:24:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266564280] [2023-11-23 22:24:03,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266564280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:24:03,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:24:03,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:24:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012269536] [2023-11-23 22:24:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:24:03,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:24:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:03,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:24:03,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:24:03,388 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-23 22:24:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:03,506 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-11-23 22:24:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:24:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2023-11-23 22:24:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:03,508 INFO L225 Difference]: With dead ends: 43 [2023-11-23 22:24:03,509 INFO L226 Difference]: Without dead ends: 26 [2023-11-23 22:24:03,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:24:03,516 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:03,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:24:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-23 22:24:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-23 22:24:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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) [2023-11-23 22:24:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-23 22:24:03,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2023-11-23 22:24:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:03,541 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-23 22:24:03,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-11-23 22:24:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-23 22:24:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 22:24:03,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:03,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:03,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:24:03,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:03,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2023-11-23 22:24:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569310396] [2023-11-23 22:24:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:24:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569310396] [2023-11-23 22:24:03,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569310396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:24:03,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:24:03,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:24:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775319311] [2023-11-23 22:24:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:24:03,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:24:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:24:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:24:03,759 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 22:24:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:03,893 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-11-23 22:24:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:24:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 22:24:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:03,895 INFO L225 Difference]: With dead ends: 34 [2023-11-23 22:24:03,895 INFO L226 Difference]: Without dead ends: 27 [2023-11-23 22:24:03,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:24:03,897 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:03,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:24:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-23 22:24:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-23 22:24:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-11-23 22:24:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-23 22:24:03,919 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 25 [2023-11-23 22:24:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:03,920 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-23 22:24:03,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 22:24:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-23 22:24:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 22:24:03,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:03,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:03,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:24:03,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:03,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2023-11-23 22:24:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:03,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387043983] [2023-11-23 22:24:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:03,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:06,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:06,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:24:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387043983] [2023-11-23 22:24:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387043983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332518112] [2023-11-23 22:24:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:24:07,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:24:07,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:24:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:07,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 103 conjunts are in the unsatisfiable core [2023-11-23 22:24:07,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:24:07,950 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:08,319 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:08,447 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 22:24:08,450 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-11-23 22:24:08,591 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:08,814 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 15 [2023-11-23 22:24:09,230 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-23 22:24:09,231 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-23 22:24:09,252 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 15 [2023-11-23 22:24:09,614 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-23 22:24:09,623 INFO L378 Elim1Store]: Elim1 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 20 treesize of output 15 [2023-11-23 22:24:09,725 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:24:09,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:24:12,136 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_404 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_404)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_406) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-23 22:24:14,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_404 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_404))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_406) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-23 22:24:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332518112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:14,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:24:14,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2023-11-23 22:24:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505376788] [2023-11-23 22:24:14,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:24:14,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-23 22:24:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-23 22:24:14,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1738, Unknown=12, NotChecked=170, Total=2070 [2023-11-23 22:24:14,395 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 40 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 22:24:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:15,777 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-11-23 22:24:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 22:24:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-23 22:24:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:15,780 INFO L225 Difference]: With dead ends: 45 [2023-11-23 22:24:15,781 INFO L226 Difference]: Without dead ends: 43 [2023-11-23 22:24:15,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=253, Invalid=2713, Unknown=12, NotChecked=214, Total=3192 [2023-11-23 22:24:15,784 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:15,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 227 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-23 22:24:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-23 22:24:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2023-11-23 22:24:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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) [2023-11-23 22:24:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2023-11-23 22:24:15,798 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 26 [2023-11-23 22:24:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:15,799 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2023-11-23 22:24:15,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 22:24:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2023-11-23 22:24:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 22:24:15,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:15,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:15,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:24:16,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:16,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:16,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:16,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2023-11-23 22:24:16,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:16,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108939075] [2023-11-23 22:24:16,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:24:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108939075] [2023-11-23 22:24:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108939075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:24:16,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:24:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:24:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016600224] [2023-11-23 22:24:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:24:16,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:24:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:24:16,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:24:16,366 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-23 22:24:16,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:16,470 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-11-23 22:24:16,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:24:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 27 [2023-11-23 22:24:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:16,474 INFO L225 Difference]: With dead ends: 40 [2023-11-23 22:24:16,475 INFO L226 Difference]: Without dead ends: 29 [2023-11-23 22:24:16,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:24:16,478 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:16,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 50 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:24:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-23 22:24:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-23 22:24:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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) [2023-11-23 22:24:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-23 22:24:16,503 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 27 [2023-11-23 22:24:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:16,504 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-23 22:24:16,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2023-11-23 22:24:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-23 22:24:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-23 22:24:16,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:16,507 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:16,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:24:16,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:16,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1881720096, now seen corresponding path program 1 times [2023-11-23 22:24:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202251261] [2023-11-23 22:24:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:24:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:16,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202251261] [2023-11-23 22:24:16,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202251261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:24:16,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:24:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:24:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620363435] [2023-11-23 22:24:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:24:16,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:24:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:24:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:24:16,765 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-11-23 22:24:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:16,854 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-11-23 22:24:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:24:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 27 [2023-11-23 22:24:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:16,858 INFO L225 Difference]: With dead ends: 38 [2023-11-23 22:24:16,858 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 22:24:16,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:24:16,862 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:16,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:24:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 22:24:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-23 22:24:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2023-11-23 22:24:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-23 22:24:16,881 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 27 [2023-11-23 22:24:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:16,882 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-23 22:24:16,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-11-23 22:24:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-23 22:24:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 22:24:16,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:16,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:16,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:24:16,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:16,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2023-11-23 22:24:16,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:16,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284885642] [2023-11-23 22:24:16,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:16,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:24:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284885642] [2023-11-23 22:24:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284885642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160702065] [2023-11-23 22:24:17,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:17,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:17,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:24:17,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:24:17,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:24:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:18,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-23 22:24:18,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:24:18,127 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:18,348 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 22:24:18,348 INFO L378 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-11-23 22:24:18,413 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:18,510 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-23 22:24:18,511 INFO L378 Elim1Store]: Elim1 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 70 treesize of output 57 [2023-11-23 22:24:18,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:24:18,780 INFO L378 Elim1Store]: Elim1 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 46 treesize of output 35 [2023-11-23 22:24:18,807 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-23 22:24:18,807 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-23 22:24:19,000 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2023-11-23 22:24:19,002 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2023-11-23 22:24:19,043 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-11-23 22:24:19,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2023-11-23 22:24:19,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2023-11-23 22:24:19,104 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 20 [2023-11-23 22:24:19,178 INFO L378 Elim1Store]: Elim1 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 19 [2023-11-23 22:24:19,184 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 8 [2023-11-23 22:24:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 22:24:19,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:24:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160702065] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:19,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:24:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 30 [2023-11-23 22:24:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78182235] [2023-11-23 22:24:19,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:24:19,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 22:24:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 22:24:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=944, Unknown=28, NotChecked=0, Total=1056 [2023-11-23 22:24:19,657 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 22:24:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:20,923 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-11-23 22:24:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-23 22:24:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-23 22:24:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:20,930 INFO L225 Difference]: With dead ends: 52 [2023-11-23 22:24:20,930 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 22:24:20,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=179, Invalid=1952, Unknown=31, NotChecked=0, Total=2162 [2023-11-23 22:24:20,933 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:20,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 274 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 22:24:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 22:24:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2023-11-23 22:24:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2023-11-23 22:24:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-23 22:24:20,952 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2023-11-23 22:24:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:20,952 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-23 22:24:20,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 22:24:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-11-23 22:24:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 22:24:20,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:20,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:20,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:24:21,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:21,175 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:21,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2023-11-23 22:24:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289834739] [2023-11-23 22:24:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:24:21,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289834739] [2023-11-23 22:24:21,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289834739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211498698] [2023-11-23 22:24:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:21,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:24:21,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:24:21,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 22:24:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:21,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-23 22:24:21,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:24:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:24:21,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:24:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 22:24:21,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211498698] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:24:21,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:24:21,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-23 22:24:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963053909] [2023-11-23 22:24:21,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:24:21,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:24:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:21,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:24:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:24:21,798 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 22:24:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:21,987 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-11-23 22:24:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 22:24:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-11-23 22:24:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:21,989 INFO L225 Difference]: With dead ends: 37 [2023-11-23 22:24:21,989 INFO L226 Difference]: Without dead ends: 29 [2023-11-23 22:24:21,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:24:21,991 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:21,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 98 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:24:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-23 22:24:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-23 22:24:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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) [2023-11-23 22:24:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-23 22:24:22,001 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 28 [2023-11-23 22:24:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:22,002 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-23 22:24:22,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 22:24:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-23 22:24:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 22:24:22,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:22,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:22,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 22:24:22,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:22,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:22,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 208832784, now seen corresponding path program 1 times [2023-11-23 22:24:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324090792] [2023-11-23 22:24:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:22,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:24:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:22,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324090792] [2023-11-23 22:24:22,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324090792] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:22,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981045660] [2023-11-23 22:24:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:22,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:24:22,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:24:22,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 22:24:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:23,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-23 22:24:23,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:24:23,080 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:23,246 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:23,318 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 22:24:23,319 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:23,388 INFO L378 Elim1Store]: Elim1 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 25 treesize of output 13 [2023-11-23 22:24:23,487 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 21 [2023-11-23 22:24:23,799 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-23 22:24:23,799 INFO L378 Elim1Store]: Elim1 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 29 [2023-11-23 22:24:23,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-23 22:24:23,839 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-23 22:24:23,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-23 22:24:24,162 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 21 [2023-11-23 22:24:24,263 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-23 22:24:24,264 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 32 [2023-11-23 22:24:24,271 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 21 [2023-11-23 22:24:24,341 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 21 [2023-11-23 22:24:24,345 INFO L378 Elim1Store]: Elim1 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 13 [2023-11-23 22:24:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:24:24,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:24:28,708 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1126 Int) (v_ArrVal_1128 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1125) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| v_ArrVal_1126)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-11-23 22:24:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981045660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:29,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 22:24:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24] total 33 [2023-11-23 22:24:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683859468] [2023-11-23 22:24:29,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 22:24:29,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-23 22:24:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:24:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-23 22:24:29,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1519, Unknown=3, NotChecked=78, Total=1722 [2023-11-23 22:24:29,396 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 22:24:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:24:30,690 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2023-11-23 22:24:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 22:24:30,691 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2023-11-23 22:24:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:24:30,692 INFO L225 Difference]: With dead ends: 37 [2023-11-23 22:24:30,692 INFO L226 Difference]: Without dead ends: 28 [2023-11-23 22:24:30,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=206, Invalid=2345, Unknown=3, NotChecked=98, Total=2652 [2023-11-23 22:24:30,695 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-23 22:24:30,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 256 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-23 22:24:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-23 22:24:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-11-23 22:24:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2023-11-23 22:24:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-23 22:24:30,705 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 28 [2023-11-23 22:24:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:24:30,706 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-23 22:24:30,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 22:24:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-23 22:24:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-23 22:24:30,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:24:30,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:24:30,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 22:24:30,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:30,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:24:30,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:24:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2023-11-23 22:24:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:24:30,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376602740] [2023-11-23 22:24:30,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:24:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 22:24:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:24:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 22:24:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-23 22:24:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:24:32,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376602740] [2023-11-23 22:24:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376602740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:24:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662215339] [2023-11-23 22:24:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:24:32,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:24:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:24:32,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:24:32,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42b32841-2da1-4aa0-afb3-917f711f1cbb/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 22:24:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:24:32,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 99 conjunts are in the unsatisfiable core [2023-11-23 22:24:32,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:24:33,053 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:33,512 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 22:24:33,611 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-23 22:24:33,612 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-11-23 22:24:33,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 22:24:33,990 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 27 [2023-11-23 22:24:34,000 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-23 22:24:34,021 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-23 22:24:34,021 INFO L378 Elim1Store]: Elim1 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 109 treesize of output 78 [2023-11-23 22:24:34,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 19 [2023-11-23 22:24:34,047 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-11-23 22:24:34,053 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 15 [2023-11-23 22:24:34,152 INFO L378 Elim1Store]: Elim1 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 50 treesize of output 30 [2023-11-23 22:24:34,251 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 15 [2023-11-23 22:24:34,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-23 22:24:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 22:24:34,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:24:34,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:24:34,595 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2023-11-23 22:24:34,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:24:34,614 INFO L378 Elim1Store]: Elim1 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 120 treesize of output 123 [2023-11-23 22:24:34,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:24:34,632 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 92 [2023-11-23 22:24:34,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 22:24:34,663 INFO L378 Elim1Store]: Elim1 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 170 treesize of output 161 [2023-11-23 22:24:34,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-11-23 22:24:34,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-11-23 22:24:35,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)) (.cse3 (and (or .cse0 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_51) .cse1)) (not (= v_ArrVal_1300 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_51) .cse1)) (not (= v_ArrVal_1300 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))))))))) (.cse4 (and (or (forall ((v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (+ 4 v_arrayElimCell_53)))) .cse0) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_51) (+ 4 v_arrayElimCell_53))) (not (= v_ArrVal_1300 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))))))) (or .cse0 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_51) (+ 4 v_arrayElimCell_53))) (not (= v_ArrVal_1300 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (or (not (= v_ArrVal_1300 (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1300 (+ 4 v_arrayElimCell_53)))))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse8))) (and (or .cse0 (forall ((v_ArrVal_1298 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse1)))) (or .cse2 .cse3) (or .cse4 .cse5) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1300 .cse1)) (not (= v_ArrVal_1300 (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55))))))) (or (not .cse0) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1298))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55))) (not (= v_ArrVal_1300 (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (or .cse5 .cse3) (or .cse4 .cse2))))) is different from false [2023-11-23 22:24:35,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse2 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse4 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse5 (and (or .cse2 (forall ((v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (+ 4 v_arrayElimCell_53))))) (or (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (or (= (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_51) (+ 4 v_arrayElimCell_53)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300))))) .cse2) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300))) (or (= (select (select .cse12 v_arrayElimCell_51) (+ 4 v_arrayElimCell_53)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300)))))) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1300 (+ 4 v_arrayElimCell_53))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300))))))) (.cse7 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse8 v_arrayElimCell_51) .cse1)) (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300)))))) (or .cse2 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_51) .cse1)) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300))))))))) (and (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1300 .cse1)) (not (= (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300))))) (or (not .cse2) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55))) (not (= (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1300)))))) (or .cse4 .cse5) (or .cse4 .cse6) (or .cse7 .cse5) (or .cse7 .cse6) (or .cse2 (forall ((v_ArrVal_1298 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse1)))))))) is different from false [2023-11-23 22:24:36,066 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse3 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse12)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse1 (and (or (forall ((v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse4 v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_1) (+ 4 v_arrayElimCell_53)))) .cse3) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_51) (+ 4 v_arrayElimCell_53))))))) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1300 (+ 4 v_arrayElimCell_53)))))) (or .cse3 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse16 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (or (not (= (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300) v_arrayElimCell_51) (+ 4 v_arrayElimCell_53))))))))) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse2 (= .cse4 .cse12)) (.cse6 (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse9 v_arrayElimCell_51) .cse5)))))) (or .cse3 (forall ((v_arrayElimCell_51 Int) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (or (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300) v_arrayElimCell_51) .cse5))))))))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse3 (forall ((v_ArrVal_1298 (Array Int Int))) (= (select (select (store |c_#memory_int#1| .cse4 v_ArrVal_1298) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse5) |c_ULTIMATE.start_main_~data~0#1|))) (or .cse0 .cse6) (or (not .cse3) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int)) (v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (let ((.cse7 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (or (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55))))))) (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| .cse4 v_ArrVal_1298))) (or (forall ((v_arrayElimCell_54 Int) (v_arrayElimCell_55 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1300) v_arrayElimCell_54) (+ 4 v_arrayElimCell_55)))) (not (= (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1300 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1300)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1300 .cse5))))) (or .cse2 .cse6))))) is different from false