./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.5-dev-4a390ef-m [2024-10-23 23:45:30,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:45:30,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 23:45:30,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:45:30,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:45:30,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:45:30,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:45:30,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:45:30,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:45:30,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:45:30,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:45:30,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:45:30,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:45:30,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:45:30,948 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:45:30,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:45:30,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:45:30,949 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:45:30,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 23:45:30,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:45:30,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:45:30,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:45:30,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:45:30,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:45:30,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:45:30,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:45:30,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:45:30,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:45:30,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:45:30,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:45:30,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:45:30,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:45:30,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:45:30,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:45:30,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:45:30,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:45:30,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 23:45:30,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 23:45:30,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:45:30,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:45:30,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:45:30,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:45:30,954 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2024-10-23 23:45:31,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:45:31,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:45:31,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:45:31,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:45:31,163 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:45:31,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-10-23 23:45:32,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:45:32,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:45:32,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-10-23 23:45:32,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d043e1665/5a6d2ca36b2c4afd9d17868f7a6c7e0c/FLAG7e759d47a [2024-10-23 23:45:32,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d043e1665/5a6d2ca36b2c4afd9d17868f7a6c7e0c [2024-10-23 23:45:32,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:45:32,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:45:32,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:45:32,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:45:32,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:45:32,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:45:32" (1/1) ... [2024-10-23 23:45:32,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e50abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:32, skipping insertion in model container [2024-10-23 23:45:32,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:45:32" (1/1) ... [2024-10-23 23:45:32,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:45:33,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2024-10-23 23:45:33,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:45:33,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:45:33,261 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2024-10-23 23:45:33,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:45:33,287 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:45:33,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33 WrapperNode [2024-10-23 23:45:33,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:45:33,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:45:33,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:45:33,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:45:33,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,320 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2024-10-23 23:45:33,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:45:33,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:45:33,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:45:33,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:45:33,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,345 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-10-23 23:45:33,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:45:33,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:45:33,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:45:33,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:45:33,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (1/1) ... [2024-10-23 23:45:33,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:45:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:33,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 23:45:33,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 23:45:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 23:45:33,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 23:45:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 23:45:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-23 23:45:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-23 23:45:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-23 23:45:33,429 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-23 23:45:33,430 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-23 23:45:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-23 23:45:33,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:45:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:45:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-23 23:45:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-23 23:45:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-23 23:45:33,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 23:45:33,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:45:33,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:45:33,547 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:45:33,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:45:33,727 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-23 23:45:33,727 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:45:33,762 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:45:33,766 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 23:45:33,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:45:33 BoogieIcfgContainer [2024-10-23 23:45:33,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:45:33,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:45:33,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:45:33,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:45:33,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:45:32" (1/3) ... [2024-10-23 23:45:33,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f536f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:45:33, skipping insertion in model container [2024-10-23 23:45:33,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:33" (2/3) ... [2024-10-23 23:45:33,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f536f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:45:33, skipping insertion in model container [2024-10-23 23:45:33,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:45:33" (3/3) ... [2024-10-23 23:45:33,773 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2024-10-23 23:45:33,786 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:45:33,786 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:45:33,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:45:33,829 INFO L333 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, 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;@4fb759f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:45:33,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:45:33,831 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) [2024-10-23 23:45:33,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 23:45:33,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:33,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:33,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:33,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2024-10-23 23:45:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579145104] [2024-10-23 23:45:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:45:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:34,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:34,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579145104] [2024-10-23 23:45:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579145104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:34,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 23:45:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519627670] [2024-10-23 23:45:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:34,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 23:45:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 23:45:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:45:34,138 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) [2024-10-23 23:45:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:34,211 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2024-10-23 23:45:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 23:45:34,213 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 [2024-10-23 23:45:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:34,217 INFO L225 Difference]: With dead ends: 54 [2024-10-23 23:45:34,218 INFO L226 Difference]: Without dead ends: 23 [2024-10-23 23:45:34,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:45:34,223 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:34,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-23 23:45:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-23 23:45:34,255 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) [2024-10-23 23:45:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-23 23:45:34,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2024-10-23 23:45:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:34,258 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-23 23:45:34,258 INFO L472 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) [2024-10-23 23:45:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-23 23:45:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 23:45:34,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:34,260 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:34,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 23:45:34,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2024-10-23 23:45:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:34,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133605737] [2024-10-23 23:45:34,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:45:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:34,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133605737] [2024-10-23 23:45:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133605737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:34,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:34,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:45:34,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007267428] [2024-10-23 23:45:34,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:34,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:45:34,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:45:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:34,414 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) [2024-10-23 23:45:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:34,451 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2024-10-23 23:45:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:45:34,452 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 [2024-10-23 23:45:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:34,453 INFO L225 Difference]: With dead ends: 41 [2024-10-23 23:45:34,453 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 23:45:34,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:34,455 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:34,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 23:45:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-23 23:45:34,459 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) [2024-10-23 23:45:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-23 23:45:34,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2024-10-23 23:45:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:34,462 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-23 23:45:34,462 INFO L472 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) [2024-10-23 23:45:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-23 23:45:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 23:45:34,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:34,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 23:45:34,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:34,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2024-10-23 23:45:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711023711] [2024-10-23 23:45:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711023711] [2024-10-23 23:45:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711023711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:34,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:34,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:45:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437421894] [2024-10-23 23:45:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:34,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:45:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:45:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:34,580 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) [2024-10-23 23:45:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:34,621 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-10-23 23:45:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:45:34,622 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 [2024-10-23 23:45:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:34,622 INFO L225 Difference]: With dead ends: 33 [2024-10-23 23:45:34,622 INFO L226 Difference]: Without dead ends: 26 [2024-10-23 23:45:34,623 INFO L431 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 [2024-10-23 23:45:34,624 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:34,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-23 23:45:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-23 23:45:34,627 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) [2024-10-23 23:45:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-23 23:45:34,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 25 [2024-10-23 23:45:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:34,629 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-23 23:45:34,629 INFO L472 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) [2024-10-23 23:45:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-23 23:45:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:45:34,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:34,630 INFO L215 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] [2024-10-23 23:45:34,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 23:45:34,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:34,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2024-10-23 23:45:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651832260] [2024-10-23 23:45:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:36,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:36,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651832260] [2024-10-23 23:45:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651832260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060086296] [2024-10-23 23:45:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:36,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:36,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:36,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 23:45:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:36,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-23 23:45:36,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:36,540 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 [2024-10-23 23:45:36,782 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 13 treesize of output 9 [2024-10-23 23:45:36,860 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:45:36,860 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 [2024-10-23 23:45:36,942 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 25 treesize of output 13 [2024-10-23 23:45:37,022 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 26 treesize of output 21 [2024-10-23 23:45:37,126 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 17 treesize of output 3 [2024-10-23 23:45:37,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-23 23:45:37,238 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-23 23:45:37,239 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 [2024-10-23 23:45:37,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:45:37,451 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 42 treesize of output 40 [2024-10-23 23:45:37,456 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 26 treesize of output 21 [2024-10-23 23:45:37,499 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 25 treesize of output 17 [2024-10-23 23:45:37,502 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 [2024-10-23 23:45:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:45:37,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060086296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:38,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:45:38,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2024-10-23 23:45:38,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825623201] [2024-10-23 23:45:38,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-23 23:45:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-23 23:45:38,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1814, Unknown=32, NotChecked=0, Total=1980 [2024-10-23 23:45:38,287 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:45:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:39,304 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2024-10-23 23:45:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-23 23:45:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2024-10-23 23:45:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:39,305 INFO L225 Difference]: With dead ends: 43 [2024-10-23 23:45:39,305 INFO L226 Difference]: Without dead ends: 41 [2024-10-23 23:45:39,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=256, Invalid=3018, Unknown=32, NotChecked=0, Total=3306 [2024-10-23 23:45:39,306 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 59 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:39,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 339 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 23:45:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-23 23:45:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2024-10-23 23:45:39,311 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) [2024-10-23 23:45:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-10-23 23:45:39,312 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 26 [2024-10-23 23:45:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:39,312 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-23 23:45:39,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:45:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-10-23 23:45:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:45:39,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:39,313 INFO L215 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] [2024-10-23 23:45:39,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 23:45:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:39,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2024-10-23 23:45:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:39,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510393362] [2024-10-23 23:45:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:39,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:39,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510393362] [2024-10-23 23:45:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510393362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:39,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:39,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 23:45:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616403398] [2024-10-23 23:45:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:39,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 23:45:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 23:45:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:45:39,632 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) [2024-10-23 23:45:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:39,674 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-10-23 23:45:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 23:45:39,674 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 [2024-10-23 23:45:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:39,675 INFO L225 Difference]: With dead ends: 42 [2024-10-23 23:45:39,675 INFO L226 Difference]: Without dead ends: 31 [2024-10-23 23:45:39,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-23 23:45:39,676 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:39,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-23 23:45:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-10-23 23:45:39,680 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) [2024-10-23 23:45:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-23 23:45:39,680 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 27 [2024-10-23 23:45:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:39,681 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-23 23:45:39,681 INFO L472 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) [2024-10-23 23:45:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-23 23:45:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:45:39,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:39,681 INFO L215 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] [2024-10-23 23:45:39,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 23:45:39,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1881720096, now seen corresponding path program 1 times [2024-10-23 23:45:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:39,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591736792] [2024-10-23 23:45:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591736792] [2024-10-23 23:45:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591736792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:39,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:39,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 23:45:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510364020] [2024-10-23 23:45:39,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:39,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 23:45:39,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:39,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 23:45:39,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:45:39,759 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) [2024-10-23 23:45:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:39,793 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-10-23 23:45:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:45:39,793 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 [2024-10-23 23:45:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:39,794 INFO L225 Difference]: With dead ends: 40 [2024-10-23 23:45:39,794 INFO L226 Difference]: Without dead ends: 30 [2024-10-23 23:45:39,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:45:39,795 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:39,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 64 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-23 23:45:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-23 23:45:39,798 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) [2024-10-23 23:45:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-23 23:45:39,799 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 27 [2024-10-23 23:45:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:39,799 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-23 23:45:39,799 INFO L472 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) [2024-10-23 23:45:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-23 23:45:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:45:39,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:39,800 INFO L215 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] [2024-10-23 23:45:39,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 23:45:39,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2024-10-23 23:45:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387380315] [2024-10-23 23:45:39,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387380315] [2024-10-23 23:45:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387380315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669156786] [2024-10-23 23:45:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:40,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:40,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:40,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:40,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 23:45:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-23 23:45:40,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:40,330 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 [2024-10-23 23:45:40,443 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:45:40,443 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 [2024-10-23 23:45:40,477 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 [2024-10-23 23:45:40,523 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-10-23 23:45:40,523 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 [2024-10-23 23:45:40,555 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 38 treesize of output 14 [2024-10-23 23:45:40,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-23 23:45:40,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:45:40,621 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 [2024-10-23 23:45:40,632 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-10-23 23:45:40,632 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 [2024-10-23 23:45:40,733 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2024-10-23 23:45:40,734 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 [2024-10-23 23:45:40,760 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-10-23 23:45:40,760 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 [2024-10-23 23:45:40,774 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 [2024-10-23 23:45:40,792 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 [2024-10-23 23:45:40,826 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 [2024-10-23 23:45:40,828 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 [2024-10-23 23:45:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:45:40,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669156786] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:41,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:45:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 30 [2024-10-23 23:45:41,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729940150] [2024-10-23 23:45:41,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-23 23:45:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:41,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-23 23:45:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1016, Unknown=18, NotChecked=0, Total=1122 [2024-10-23 23:45:41,063 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) [2024-10-23 23:45:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:41,717 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-23 23:45:41,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-23 23:45:41,717 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 [2024-10-23 23:45:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:41,718 INFO L225 Difference]: With dead ends: 52 [2024-10-23 23:45:41,718 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 23:45:41,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=2138, Unknown=19, NotChecked=0, Total=2352 [2024-10-23 23:45:41,722 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:41,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 320 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 23:45:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 23:45:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2024-10-23 23:45:41,730 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) [2024-10-23 23:45:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-23 23:45:41,730 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2024-10-23 23:45:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:41,731 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-23 23:45:41,731 INFO L472 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) [2024-10-23 23:45:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-23 23:45:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:45:41,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:41,731 INFO L215 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] [2024-10-23 23:45:41,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 23:45:41,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-23 23:45:41,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:41,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:41,939 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2024-10-23 23:45:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779277567] [2024-10-23 23:45:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:41,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:42,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779277567] [2024-10-23 23:45:42,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779277567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:42,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119797938] [2024-10-23 23:45:42,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:42,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:42,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:42,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:42,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 23:45:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-23 23:45:42,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:42,265 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 [2024-10-23 23:45:42,386 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 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-23 23:45:42,389 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 18 treesize of output 13 [2024-10-23 23:45:42,403 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 15 treesize of output 1 [2024-10-23 23:45:42,406 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 23 treesize of output 3 [2024-10-23 23:45:42,428 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 [2024-10-23 23:45:42,434 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 [2024-10-23 23:45:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 23:45:42,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:42,506 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 64 treesize of output 60 [2024-10-23 23:45:42,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse3 (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|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse7 (forall ((v_ArrVal_960 Int) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_960)) .cse3 v_ArrVal_958) .cse6) (+ 4 v_arrayElimCell_37)))))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_960 Int) (v_ArrVal_958 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_960)) .cse3 v_ArrVal_958) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4)))) (forall ((v_ArrVal_960 Int) (v_ArrVal_958 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_960)) .cse3 v_ArrVal_958))) (or (forall ((v_arrayElimCell_37 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse6) (+ 4 v_arrayElimCell_37)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4))))) (or .cse0 .cse7) (or .cse1 .cse7)))) is different from false [2024-10-23 23:45:42,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:42,796 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 140 treesize of output 135 [2024-10-23 23:45:42,838 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 7 treesize of output 3 [2024-10-23 23:45:42,845 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 7 treesize of output 3 [2024-10-23 23:45:42,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:42,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 85 [2024-10-23 23:45:42,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-23 23:45:42,926 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 42 treesize of output 30 [2024-10-23 23:45:42,929 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 34 treesize of output 26 [2024-10-23 23:45:43,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:43,000 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 2 case distinctions, treesize of input 25 treesize of output 31 [2024-10-23 23:45:43,003 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 36 treesize of output 24 [2024-10-23 23:45:43,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:43,013 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 19 treesize of output 19 [2024-10-23 23:45:43,024 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-10-23 23:45:43,024 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 2 case distinctions, treesize of input 25 treesize of output 1 [2024-10-23 23:45:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 23:45:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119797938] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:45:43,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:45:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 27 [2024-10-23 23:45:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202262314] [2024-10-23 23:45:43,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:43,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-23 23:45:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-23 23:45:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=569, Unknown=13, NotChecked=48, Total=702 [2024-10-23 23:45:43,037 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 27 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-23 23:45:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:43,464 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-10-23 23:45:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-23 23:45:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 28 [2024-10-23 23:45:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:43,465 INFO L225 Difference]: With dead ends: 47 [2024-10-23 23:45:43,465 INFO L226 Difference]: Without dead ends: 39 [2024-10-23 23:45:43,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=913, Unknown=13, NotChecked=62, Total=1122 [2024-10-23 23:45:43,466 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:43,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 256 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 404 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2024-10-23 23:45:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-23 23:45:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-10-23 23:45:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 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) [2024-10-23 23:45:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-23 23:45:43,471 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 28 [2024-10-23 23:45:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:43,471 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-23 23:45:43,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-23 23:45:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-23 23:45:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 23:45:43,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:43,472 INFO L215 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] [2024-10-23 23:45:43,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 23:45:43,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:43,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:43,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2024-10-23 23:45:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:43,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747006557] [2024-10-23 23:45:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:44,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:44,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747006557] [2024-10-23 23:45:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747006557] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:44,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915475365] [2024-10-23 23:45:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:44,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:44,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:44,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 23:45:44,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 23:45:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:44,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-23 23:45:44,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:44,668 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 [2024-10-23 23:45:44,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 9 treesize of output 3 [2024-10-23 23:45:44,880 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 [2024-10-23 23:45:44,935 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:45:44,936 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 [2024-10-23 23:45:45,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:45:45,169 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 [2024-10-23 23:45:45,173 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 [2024-10-23 23:45:45,177 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 [2024-10-23 23:45:45,188 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-23 23:45:45,190 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 93 treesize of output 62 [2024-10-23 23:45:45,199 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 [2024-10-23 23:45:45,208 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 [2024-10-23 23:45:45,269 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 [2024-10-23 23:45:45,365 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 [2024-10-23 23:45:45,368 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 [2024-10-23 23:45:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:45:45,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:45,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:45,503 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 [2024-10-23 23:45:45,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:45,513 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 [2024-10-23 23:45:45,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:45,521 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 [2024-10-23 23:45:45,526 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 44 treesize of output 38 [2024-10-23 23:45:45,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:45,538 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 158 treesize of output 149 [2024-10-23 23:45:45,544 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 [2024-10-23 23:45:45,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (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 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse11 (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))) (.cse12 (not .cse0))) (let ((.cse2 (or .cse11 .cse12)) (.cse1 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (or (not (= (store (select .cse21 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1130 (+ 4 v_arrayElimCell_61))))))) (.cse9 (= (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|)) (.cse4 (or .cse0 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_58) (+ 4 v_arrayElimCell_61))) (not (= (store (select .cse20 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130))))))) (.cse5 (forall ((v_arrayElimCell_62 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130))) (or (not (= (store (select .cse18 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_58) .cse8)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))))) (.cse6 (or .cse0 (forall ((v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (or (not (= (store (select .cse17 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_58) .cse8))))))) (.cse7 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_62 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_58) (+ 4 v_arrayElimCell_61))) (not (= (store (select .cse16 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))))) (.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse14))) (and (or (and (or .cse0 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1132 (Array Int Int)) (v_DerPreprocessor_2 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_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2) (+ 4 v_arrayElimCell_61))))) .cse1 .cse2) .cse3) (or .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse2)) (or .cse0 (forall ((v_ArrVal_1132 (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_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse8)))) (or (and .cse1 (or .cse0 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1132 (Array Int Int)) (v_DerPreprocessor_4 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_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_4) (+ 4 v_arrayElimCell_61)))))) .cse9) (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1130 .cse8)) (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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))) (or .cse9 (and .cse4 .cse5 .cse6 .cse7 (or .cse11 .cse3 .cse12))) (or .cse12 (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1132))) (or (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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))))))))) is different from false [2024-10-23 23:45:46,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (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 (= .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse9 (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_1130)) (= |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| v_ArrVal_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))) (.cse4 (not .cse1)) (.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse0 (= |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|))) (.cse2 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (or (not (= v_ArrVal_1130 (store (select .cse21 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1130 (+ 4 v_arrayElimCell_61))))))) (.cse10 (= .cse20 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse6 (forall ((v_arrayElimCell_62 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_58) .cse3)) (not (= v_ArrVal_1130 (store (select .cse19 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))))) (.cse7 (or .cse1 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_58) (+ 4 v_arrayElimCell_61))) (not (= v_ArrVal_1130 (store (select .cse17 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse13 (or .cse9 .cse4)) (.cse8 (or (forall ((v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_58) .cse3)) (not (= v_ArrVal_1130 (store (select .cse16 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse1)) (.cse11 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_62 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_58) (+ 4 v_arrayElimCell_61))) (not (= v_ArrVal_1130 (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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))))))))) (and (or .cse0 (and (or .cse1 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1132 (Array Int Int)) (v_DerPreprocessor_4 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_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_4) (+ 4 v_arrayElimCell_61))))) .cse2)) (or .cse1 (forall ((v_ArrVal_1132 (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_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3)))) (or .cse4 (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (or (not (= v_ArrVal_1130 (store (select .cse5 |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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))))))) (or .cse0 (and .cse6 .cse7 .cse8 (or .cse9 .cse4 .cse10) .cse11)) (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1130 .cse3)) (not (= v_ArrVal_1130 (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_1130 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))) (or .cse10 (and .cse13 .cse2 (or .cse1 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1132 (Array Int Int)) (v_DerPreprocessor_2 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_1132) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_2) (+ 4 v_arrayElimCell_61))))))) (or .cse10 (and .cse6 .cse7 .cse13 .cse8 .cse11))))))) is different from false [2024-10-23 23:45:46,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (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|)) (.cse10 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse16))) (let ((.cse0 (not .cse10)) (.cse2 (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse11 v_ArrVal_1132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130))))) (.cse12 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4))) (let ((.cse3 (or .cse10 (forall ((v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (or (not (= (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130) v_arrayElimCell_58) .cse12))))))) (.cse4 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_62 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse21 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_58) (+ 4 v_arrayElimCell_61))) (not (= (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))))) (.cse5 (or .cse10 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse19 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130) v_arrayElimCell_58) (+ 4 v_arrayElimCell_61))) (not (= (store (select .cse19 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130))))))) (.cse6 (forall ((v_arrayElimCell_62 Int) (v_arrayElimCell_58 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (let ((.cse18 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130))) (or (not (= (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_58) .cse12))))))) (.cse7 (= (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|))) (.cse1 (= .cse11 .cse16)) (.cse9 (forall ((v_arrayElimCell_61 Int) (v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (or (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_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1130 (+ 4 v_arrayElimCell_61))))))) (.cse8 (or .cse0 .cse2))) (and (or (and (or .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6) .cse7) (or .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse8)) (or (and .cse9 (or .cse10 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1132 (Array Int Int)) (v_DerPreprocessor_4 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse11 v_ArrVal_1132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_4) (+ 4 v_arrayElimCell_61)))))) .cse7) (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1130 .cse12)) (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))) (or .cse1 (and .cse9 .cse8 (or .cse10 (forall ((v_arrayElimCell_61 Int) (v_ArrVal_1132 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse11 v_ArrVal_1132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_2) (+ 4 v_arrayElimCell_61))))))) (or .cse10 (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse11 v_ArrVal_1132) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse12)))) (or .cse0 (forall ((v_arrayElimCell_62 Int) (v_ArrVal_1132 (Array Int Int)) (v_arrayElimCell_59 Int) (v_ArrVal_1130 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| .cse11 v_ArrVal_1132))) (or (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_1130 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1130)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1130) v_arrayElimCell_59) (+ 4 v_arrayElimCell_62)))))))))))) is different from false [2024-10-23 23:45:48,338 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-10-23 23:45:48,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 3051 treesize of output 3232 [2024-10-23 23:45:48,442 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 1793 treesize of output 1789 [2024-10-23 23:45:48,661 INFO L224 Elim1Store]: Index analysis took 122 ms [2024-10-23 23:45:50,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:50,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2303 treesize of output 3753 [2024-10-23 23:45:51,384 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-10-23 23:45:51,385 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2094 treesize of output 2128 [2024-10-23 23:45:51,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:51,867 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2081 treesize of output 2089 [2024-10-23 23:45:52,787 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-23 23:45:52,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2076 treesize of output 2091 [2024-10-23 23:45:53,312 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-10-23 23:45:53,313 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2067 treesize of output 2086 [2024-10-23 23:45:54,366 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-10-23 23:45:54,367 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2058 treesize of output 2092 [2024-10-23 23:45:54,913 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 2045 treesize of output 2041 [2024-10-23 23:45:55,497 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-10-23 23:45:55,498 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2041 treesize of output 2060 [2024-10-23 23:45:56,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:45:56,527 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2032 treesize of output 2040 [2024-10-23 23:45:57,485 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 2027 treesize of output 2025 [2024-10-23 23:45:58,052 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-23 23:45:58,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2025 treesize of output 2040 [2024-10-23 23:45:58,636 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-23 23:45:58,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2016 treesize of output 2031 [2024-10-23 23:45:59,247 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 2021 treesize of output 2017 [2024-10-23 23:45:59,836 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 2017 treesize of output 2013 [2024-10-23 23:46:00,431 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-23 23:46:00,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2013 treesize of output 2028 [2024-10-23 23:46:01,020 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 2018 treesize of output 2014 [2024-10-23 23:46:01,644 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-23 23:46:01,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2014 treesize of output 2029 [2024-10-23 23:46:02,320 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-23 23:46:02,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2005 treesize of output 2020