./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:52:19,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:52:19,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:52:19,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:52:19,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:52:19,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:52:19,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:52:19,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:52:19,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:52:19,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:52:19,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:52:19,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:52:19,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:52:19,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:52:19,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:52:19,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:52:19,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:52:19,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:52:19,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:52:19,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:52:19,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:52:19,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:52:19,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:52:19,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:52:19,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:52:19,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:52:19,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:52:19,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:52:19,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:52:19,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:52:19,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:52:19,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:52:19,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:52:19,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:52:19,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:52:19,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:52:19,126 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-22 00:52:19,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:52:19,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:52:19,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:52:19,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:52:19,358 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:52:19,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-22 00:52:20,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:52:20,759 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:52:20,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-22 00:52:20,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c8589d8/1e490119df1e46c380914a117c4a9c69/FLAG2bbb3ac46 [2024-11-22 00:52:21,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c8589d8/1e490119df1e46c380914a117c4a9c69 [2024-11-22 00:52:21,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:52:21,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:52:21,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:52:21,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:52:21,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:52:21,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d169ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21, skipping insertion in model container [2024-11-22 00:52:21,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:52:21,444 WARN L250 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/dll2c_insert_unequal.i[25148,25161] [2024-11-22 00:52:21,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:52:21,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:52:21,497 WARN L250 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/dll2c_insert_unequal.i[25148,25161] [2024-11-22 00:52:21,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:52:21,525 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:52:21,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21 WrapperNode [2024-11-22 00:52:21,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:52:21,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:52:21,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:52:21,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:52:21,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,563 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2024-11-22 00:52:21,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:52:21,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:52:21,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:52:21,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:52:21,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,597 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 1, 17]. [2024-11-22 00:52:21,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:52:21,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:52:21,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:52:21,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:52:21,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (1/1) ... [2024-11-22 00:52:21,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:52:21,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:52:21,653 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-11-22 00:52:21,661 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-11-22 00:52:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:52:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:52:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 00:52:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:52:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:52:21,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 00:52:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-22 00:52:21,696 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-22 00:52:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:52:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 00:52:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 00:52:21,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:52:21,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:52:21,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:52:21,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:52:22,058 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-22 00:52:22,058 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:52:22,072 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:52:22,072 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 00:52:22,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:22 BoogieIcfgContainer [2024-11-22 00:52:22,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:52:22,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:52:22,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:52:22,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:52:22,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:52:21" (1/3) ... [2024-11-22 00:52:22,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2647a5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:52:22, skipping insertion in model container [2024-11-22 00:52:22,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:52:21" (2/3) ... [2024-11-22 00:52:22,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2647a5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:52:22, skipping insertion in model container [2024-11-22 00:52:22,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:52:22" (3/3) ... [2024-11-22 00:52:22,079 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-22 00:52:22,092 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:52:22,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 00:52:22,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:52:22,152 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;@112f010a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:52:22,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 00:52:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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-11-22 00:52:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 00:52:22,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:22,162 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:22,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2024-11-22 00:52:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:22,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752172868] [2024-11-22 00:52:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:52:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752172868] [2024-11-22 00:52:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752172868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:52:22,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:52:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:52:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915262936] [2024-11-22 00:52:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:52:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:52:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:52:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:52:22,441 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11-22 00:52:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:22,456 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-22 00:52:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:52:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-22 00:52:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:22,464 INFO L225 Difference]: With dead ends: 79 [2024-11-22 00:52:22,465 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 00:52:22,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:52:22,470 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:22,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:52:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 00:52:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-22 00:52:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-11-22 00:52:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-22 00:52:22,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2024-11-22 00:52:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:22,501 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-22 00:52:22,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-11-22 00:52:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-22 00:52:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 00:52:22,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:22,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:22,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:52:22,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:22,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2024-11-22 00:52:22,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:22,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720986355] [2024-11-22 00:52:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 00:52:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720986355] [2024-11-22 00:52:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720986355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:52:22,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:52:22,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:52:22,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018624536] [2024-11-22 00:52:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:52:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:52:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:52:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:52:22,705 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-22 00:52:22,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:22,721 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2024-11-22 00:52:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:52:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2024-11-22 00:52:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:22,723 INFO L225 Difference]: With dead ends: 68 [2024-11-22 00:52:22,723 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 00:52:22,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:52:22,725 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:22,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:52:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 00:52:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-22 00:52:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-11-22 00:52:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-22 00:52:22,731 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2024-11-22 00:52:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-22 00:52:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11-22 00:52:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-22 00:52:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 00:52:22,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:22,734 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:22,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:52:22,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:22,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2024-11-22 00:52:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397361190] [2024-11-22 00:52:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:52:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397361190] [2024-11-22 00:52:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397361190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:52:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:52:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 00:52:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759194821] [2024-11-22 00:52:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:52:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 00:52:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 00:52:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:52:22,867 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11-22 00:52:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:22,887 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-22 00:52:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 00:52:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 35 [2024-11-22 00:52:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:22,889 INFO L225 Difference]: With dead ends: 53 [2024-11-22 00:52:22,890 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 00:52:22,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 00:52:22,891 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:22,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:52:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 00:52:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-22 00:52:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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-11-22 00:52:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-22 00:52:22,898 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2024-11-22 00:52:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:22,899 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-22 00:52:22,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11-22 00:52:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-22 00:52:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 00:52:22,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:22,902 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:22,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:52:22,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:22,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2024-11-22 00:52:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738663794] [2024-11-22 00:52:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:52:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738663794] [2024-11-22 00:52:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738663794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127246440] [2024-11-22 00:52:25,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:25,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:25,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:52:25,169 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-11-22 00:52:25,170 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-11-22 00:52:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:25,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 134 conjuncts are in the unsatisfiable core [2024-11-22 00:52:25,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:52:25,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-22 00:52:26,004 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-11-22 00:52:26,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-22 00:52:26,112 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:52:26,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 00:52:26,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-22 00:52:26,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 00:52:26,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 00:52:26,285 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 72 treesize of output 61 [2024-11-22 00:52:26,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 00:52:26,490 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-22 00:52:26,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 122 [2024-11-22 00:52:26,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:52:26,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2024-11-22 00:52:26,511 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 18 treesize of output 11 [2024-11-22 00:52:26,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 69 [2024-11-22 00:52:26,764 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-22 00:52:26,765 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 101 [2024-11-22 00:52:26,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-22 00:52:26,774 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 24 treesize of output 16 [2024-11-22 00:52:26,778 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 11 treesize of output 3 [2024-11-22 00:52:26,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:52:26,983 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-22 00:52:26,984 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 2 case distinctions, treesize of input 190 treesize of output 115 [2024-11-22 00:52:27,001 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 00:52:27,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 00:52:27,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 00:52:27,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 23 [2024-11-22 00:52:27,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 26 [2024-11-22 00:52:27,341 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 26 treesize of output 15 [2024-11-22 00:52:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 00:52:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:52:27,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:52:27,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int))) (or (not (= v_ArrVal_447 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_447 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_448) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2024-11-22 00:52:27,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_447) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_449) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) v_ArrVal_448) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_447 (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_447 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2024-11-22 00:52:27,596 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_448 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= v_ArrVal_447 (store (select |c_#memory_int#2| .cse0) .cse1 (select v_ArrVal_447 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int#2| .cse0 v_ArrVal_447) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_449) (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) v_ArrVal_448) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2024-11-22 00:52:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127246440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:27,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:52:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2024-11-22 00:52:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610193582] [2024-11-22 00:52:27,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:52:27,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 00:52:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:27,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 00:52:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2294, Unknown=3, NotChecked=294, Total=2756 [2024-11-22 00:52:27,732 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:29,807 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2024-11-22 00:52:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 00:52:29,807 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2024-11-22 00:52:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:29,808 INFO L225 Difference]: With dead ends: 129 [2024-11-22 00:52:29,808 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 00:52:29,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=363, Invalid=4902, Unknown=3, NotChecked=432, Total=5700 [2024-11-22 00:52:29,810 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 110 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:29,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 516 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1265 Invalid, 1 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 00:52:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 00:52:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2024-11-22 00:52:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2024-11-22 00:52:29,824 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 36 [2024-11-22 00:52:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:29,824 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2024-11-22 00:52:29,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2024-11-22 00:52:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:52:29,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:29,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:29,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 00:52:30,030 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-11-22 00:52:30,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2024-11-22 00:52:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076786965] [2024-11-22 00:52:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:52:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076786965] [2024-11-22 00:52:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076786965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:52:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:52:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:52:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378649869] [2024-11-22 00:52:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:52:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:52:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:52:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:52:30,131 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-22 00:52:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:30,151 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2024-11-22 00:52:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:52:30,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 37 [2024-11-22 00:52:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:30,152 INFO L225 Difference]: With dead ends: 82 [2024-11-22 00:52:30,152 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 00:52:30,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:52:30,153 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:30,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:52:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 00:52:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-22 00:52:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-22 00:52:30,167 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 37 [2024-11-22 00:52:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:30,168 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-22 00:52:30,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-11-22 00:52:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-22 00:52:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 00:52:30,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:30,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:30,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:52:30,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:30,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2024-11-22 00:52:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132401971] [2024-11-22 00:52:30,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:52:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:30,206 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:52:30,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:52:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-22 00:52:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:30,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132401971] [2024-11-22 00:52:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132401971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:30,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712883517] [2024-11-22 00:52:30,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 00:52:30,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:30,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:52:30,344 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-11-22 00:52:30,345 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-11-22 00:52:30,491 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 00:52:30,491 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 00:52:30,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 00:52:30,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:52:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:52:30,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 00:52:30,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712883517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:52:30,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 00:52:30,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-22 00:52:30,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057001474] [2024-11-22 00:52:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:52:30,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:52:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:52:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:52:30,519 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-11-22 00:52:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:30,540 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-22 00:52:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:52:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 37 [2024-11-22 00:52:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:30,541 INFO L225 Difference]: With dead ends: 83 [2024-11-22 00:52:30,541 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 00:52:30,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 00:52:30,541 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:30,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:52:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 00:52:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-22 00:52:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2024-11-22 00:52:30,549 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 37 [2024-11-22 00:52:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2024-11-22 00:52:30,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-11-22 00:52:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2024-11-22 00:52:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 00:52:30,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:30,550 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:30,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 00:52:30,750 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,SelfDestructingSolverStorable5 [2024-11-22 00:52:30,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2024-11-22 00:52:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970374221] [2024-11-22 00:52:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:52:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:30,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970374221] [2024-11-22 00:52:30,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970374221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133481680] [2024-11-22 00:52:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:30,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:30,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:52:30,846 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-11-22 00:52:30,847 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-11-22 00:52:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:30,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 00:52:30,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:52:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:52:31,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:52:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 00:52:31,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133481680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:52:31,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:52:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-22 00:52:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350062160] [2024-11-22 00:52:31,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:52:31,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:52:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:31,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:52:31,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:52:31,071 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-11-22 00:52:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:31,147 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2024-11-22 00:52:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:52:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 38 [2024-11-22 00:52:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:31,149 INFO L225 Difference]: With dead ends: 78 [2024-11-22 00:52:31,149 INFO L226 Difference]: Without dead ends: 63 [2024-11-22 00:52:31,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:52:31,150 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:31,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:52:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-22 00:52:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-22 00:52:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-11-22 00:52:31,161 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 38 [2024-11-22 00:52:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:31,161 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-11-22 00:52:31,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-11-22 00:52:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-11-22 00:52:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 00:52:31,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:31,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:31,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 00:52:31,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:31,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2024-11-22 00:52:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293441503] [2024-11-22 00:52:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 00:52:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293441503] [2024-11-22 00:52:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293441503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503101255] [2024-11-22 00:52:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:31,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:31,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:52:31,557 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-11-22 00:52:31,558 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-11-22 00:52:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:31,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-22 00:52:31,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:52:31,724 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-11-22 00:52:31,841 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-11-22 00:52:31,890 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:52:31,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 00:52:31,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 00:52:32,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 00:52:32,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:52:32,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2024-11-22 00:52:32,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2024-11-22 00:52:32,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2024-11-22 00:52:32,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-11-22 00:52:32,351 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 00:52:32,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2024-11-22 00:52:32,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-22 00:52:32,378 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-22 00:52:32,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-22 00:52:32,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-22 00:52:32,715 INFO L349 Elim1Store]: treesize reduction 67, result has 29.5 percent of original size [2024-11-22 00:52:32,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 52 [2024-11-22 00:52:32,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-22 00:52:32,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:52:32,780 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 41 treesize of output 37 [2024-11-22 00:52:32,786 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-11-22 00:52:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:52:32,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:52:37,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 Int) (v_ArrVal_1151 Int) (v_ArrVal_1146 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1146) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| v_ArrVal_1150)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| v_ArrVal_1151)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2024-11-22 00:52:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503101255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:37,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 00:52:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 27] total 36 [2024-11-22 00:52:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719159213] [2024-11-22 00:52:37,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 00:52:37,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-22 00:52:37,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:52:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-22 00:52:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1768, Unknown=2, NotChecked=84, Total=1980 [2024-11-22 00:52:37,752 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 36 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 30 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 00:52:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:52:39,182 INFO L93 Difference]: Finished difference Result 123 states and 149 transitions. [2024-11-22 00:52:39,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 00:52:39,182 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 30 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2024-11-22 00:52:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:52:39,183 INFO L225 Difference]: With dead ends: 123 [2024-11-22 00:52:39,183 INFO L226 Difference]: Without dead ends: 73 [2024-11-22 00:52:39,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=247, Invalid=3537, Unknown=2, NotChecked=120, Total=3906 [2024-11-22 00:52:39,187 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 00:52:39,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 620 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 00:52:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-22 00:52:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2024-11-22 00:52:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 00:52:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-11-22 00:52:39,200 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 38 [2024-11-22 00:52:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:52:39,200 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-11-22 00:52:39,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 30 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 00:52:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-11-22 00:52:39,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 00:52:39,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:52:39,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:52:39,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 00:52:39,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:39,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 00:52:39,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:52:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2024-11-22 00:52:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:52:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804387400] [2024-11-22 00:52:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:52:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:52:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:52:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804387400] [2024-11-22 00:52:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804387400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:52:40,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777493715] [2024-11-22 00:52:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:52:40,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:52:40,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:52:40,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 00:52:40,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 00:52:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:52:41,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 155 conjuncts are in the unsatisfiable core [2024-11-22 00:52:41,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:52:41,235 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-11-22 00:52:41,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-22 00:52:41,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-22 00:52:41,558 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:52:41,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 00:52:41,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 00:52:41,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 00:52:41,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-22 00:52:41,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:52:41,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 00:52:41,736 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 7 treesize of output 3 [2024-11-22 00:52:41,741 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-22 00:52:41,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2024-11-22 00:52:41,870 INFO L349 Elim1Store]: treesize reduction 46, result has 24.6 percent of original size [2024-11-22 00:52:41,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 98 [2024-11-22 00:52:41,873 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 11 treesize of output 7 [2024-11-22 00:52:41,877 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 70 treesize of output 51 [2024-11-22 00:52:41,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2024-11-22 00:52:41,991 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 30 treesize of output 14 [2024-11-22 00:52:41,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-11-22 00:52:42,130 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-11-22 00:52:42,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:52:42,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-22 00:52:42,236 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-22 00:52:42,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 00:52:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:52:42,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 22 [2024-11-22 00:52:42,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-11-22 00:52:42,579 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 103 treesize of output 50 [2024-11-22 00:52:42,594 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-22 00:52:42,594 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 2 case distinctions, treesize of input 115 treesize of output 64 [2024-11-22 00:52:42,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-22 00:52:42,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2024-11-22 00:52:42,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:52:42,715 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 66 treesize of output 46 [2024-11-22 00:52:42,835 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 27 treesize of output 15 [2024-11-22 00:52:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 00:52:42,937 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 15 treesize of output 7 [2024-11-22 00:52:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:52:42,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:52:43,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:52:43,043 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 83 treesize of output 84 [2024-11-22 00:52:43,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:52:43,055 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 650 treesize of output 641 [2024-11-22 00:52:43,063 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 147 treesize of output 141 [2024-11-22 00:52:43,069 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 152 treesize of output 140 [2024-11-22 00:52:43,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (not .cse10))) (let ((.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8)) (.cse18 (or (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= (select (select (store (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)) (+ 8 v_arrayElimCell_90)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse0)) (.cse19 (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= (select .cse30 (+ 8 v_arrayElimCell_90)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 (+ 8 v_arrayElimCell_88))))))) (.cse20 (or .cse10 (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_88)))))))) (.cse13 (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse21 (or .cse10 (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)) (+ 8 v_arrayElimCell_88)))))) (.cse22 (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= (select .cse25 (+ 8 v_arrayElimCell_90)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse25 (+ 8 v_arrayElimCell_88)))))))) (and (or .cse0 (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= (select .cse1 (+ 8 v_arrayElimCell_90)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse1 (+ 8 v_arrayElimCell_91))))))) (or (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse8))))) .cse10) (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= (select .cse11 (+ 8 v_arrayElimCell_90)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse8))))) (or (not .cse13) (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)) (+ 8 v_arrayElimCell_91))))) (or (and (or .cse10 (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)) .cse8)))) (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse16 (select (store (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= (select .cse16 (+ 8 v_arrayElimCell_90)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse8))))) .cse18) .cse13) (or (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (and .cse19 .cse20 (or .cse13 (and .cse21 .cse22 .cse18)))) (or (let ((.cse23 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and .cse19 .cse20 (or .cse13 (and .cse21 .cse22 (or (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse23 .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)) (+ 8 v_arrayElimCell_90)))) .cse0))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse23 .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1372) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1376) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_90)))))) .cse0))) (= .cse5 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))))))) is different from false [2024-11-22 00:52:43,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse14 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse13))) (let ((.cse18 (not .cse14)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse11 (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (or .cse18 (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse33 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)) (+ 8 v_arrayElimCell_90)))))) (.cse5 (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_88))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ 8 v_arrayElimCell_91))))))) (.cse6 (or .cse14 (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_88))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ 8 v_arrayElimCell_91)))))))) (.cse2 (or .cse14 (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)) (+ 8 v_arrayElimCell_88)))))) (.cse4 (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_88))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 (+ 8 v_arrayElimCell_90))))))) (.cse1 (= .cse11 .cse13)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (and (or .cse1 (and .cse2 .cse3 .cse4)) .cse5 .cse6)) (or .cse1 (and (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 (+ 8 v_arrayElimCell_90))) (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|)))) (or .cse14 (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= (select (select (store (let ((.cse15 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))) .cse3)) (or (let ((.cse17 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and .cse5 (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse17 .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379)) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 (+ 8 v_arrayElimCell_90))) (= (select .cse16 (+ 8 v_arrayElimCell_91)) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse18) .cse6 (or (and .cse2 (or (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse17 .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379)) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)) (+ 8 v_arrayElimCell_90)))) .cse18) .cse4) .cse1))) (= .cse13 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse19 (+ 8 v_arrayElimCell_91)))))) .cse18) (or (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)) (+ 8 v_arrayElimCell_91)))) (not .cse1)) (or (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse22 (select (store (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= (select .cse22 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (+ 8 v_arrayElimCell_91)))))) .cse14) (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1371))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse10 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1379))) .cse11 v_ArrVal_1372) (select (select (store (store .cse12 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1375) .cse11 v_ArrVal_1376) .cse13) .cse0)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_90))) (= (select .cse24 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (+ 8 v_arrayElimCell_91))))))))))) is different from false [2024-11-22 00:52:44,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse36 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse27 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse14 (= .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (let ((.cse10 (not .cse14)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$#2.base| .cse3 (store .cse36 .cse27 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (.cse4 (select .cse36 .cse27)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8)) (.cse19 (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse35 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_88))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 (+ 8 v_arrayElimCell_91))))))) (.cse20 (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse32 (select (store (let ((.cse33 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse33 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 (+ 8 v_arrayElimCell_88))))))) (.cse21 (or .cse14 (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse31 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)) (+ 8 v_arrayElimCell_88)))))) (.cse26 (or (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse30 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)) (+ 8 v_arrayElimCell_90)))) .cse10)) (.cse0 (= .cse4 .cse6)) (.cse22 (or .cse14 (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_88))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (+ 8 v_arrayElimCell_91))))))))) (and (or (not .cse0) (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)) (+ 8 v_arrayElimCell_91))))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse8 (select (store (let ((.cse9 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse8 (+ 8 v_arrayElimCell_91)))))) .cse10) (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse13 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 .cse12))))) (or .cse14 (forall ((v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 .cse12)))))) (or (= .cse3 .cse6) (let ((.cse18 (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int#2| .cse3 v_ArrVal_1371) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse18 .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379)) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_91))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 (+ 8 v_arrayElimCell_90)))))) .cse10) .cse19 (or (and .cse20 (or (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#2| .cse3 v_ArrVal_1371) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store .cse18 .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379)) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)) (+ 8 v_arrayElimCell_90)))) .cse10) .cse21) .cse0) .cse22))) (or (and (forall ((v_arrayElimCell_90 Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse24 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 (+ 8 v_arrayElimCell_90))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse23 .cse12))))) (or (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_ArrVal_1379 Int) (v_ArrVal_1372 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#2| .cse3 v_ArrVal_1371))) (store .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse2 v_DerPreprocessor_4) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1379))) .cse4 v_ArrVal_1372) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1375) .cse4 v_ArrVal_1376) .cse6) .cse7)) .cse12))) .cse14) .cse26) .cse0) (or (and .cse19 (or (and .cse20 .cse21 .cse26) .cse0) .cse22) (= .cse7 .cse27))))))) is different from false [2024-11-22 00:52:51,646 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 985 DAG size of output: 319 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-22 00:52:51,647 INFO L349 Elim1Store]: treesize reduction 20610, result has 14.1 percent of original size [2024-11-22 00:52:51,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 20 new quantified variables, introduced 191 case distinctions, treesize of input 109868 treesize of output 106580 [2024-11-22 00:52:52,857 INFO L224 Elim1Store]: Index analysis took 796 ms [2024-11-22 00:52:57,986 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 834 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-22 00:52:57,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:52:57,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 36912 treesize of output 55262 [2024-11-22 00:52:59,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:52:59,406 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 35030 treesize of output 35007 [2024-11-22 00:53:00,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:00,712 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 34794 treesize of output 34771 [2024-11-22 00:53:01,541 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 34762 treesize of output 34758 [2024-11-22 00:53:02,345 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 34758 treesize of output 34742 [2024-11-22 00:53:03,137 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 34832 treesize of output 34820 [2024-11-22 00:53:04,447 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 34786 treesize of output 34770 [2024-11-22 00:53:05,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:05,360 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 34950 treesize of output 34935 [2024-11-22 00:53:06,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:06,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35272 treesize of output 35253 [2024-11-22 00:53:08,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:08,035 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 34990 treesize of output 34967 [2024-11-22 00:53:09,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:09,019 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 34958 treesize of output 34959 [2024-11-22 00:53:10,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:10,019 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 34950 treesize of output 34927 [2024-11-22 00:53:11,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:11,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34918 treesize of output 34895 [2024-11-22 00:53:12,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:12,227 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 35194 treesize of output 35171 [2024-11-22 00:53:13,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:13,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35426 treesize of output 35405 [2024-11-22 00:53:15,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:15,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35040 treesize of output 35025 [2024-11-22 00:53:16,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:16,707 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 35000 treesize of output 34977 [2024-11-22 00:53:17,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:17,871 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 35058 treesize of output 35049 [2024-11-22 00:53:19,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:19,261 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 35006 treesize of output 34991 [2024-11-22 00:53:20,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:20,428 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 35450 treesize of output 35419 [2024-11-22 00:53:21,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:21,822 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 35070 treesize of output 35047 [2024-11-22 00:53:22,992 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 35128 treesize of output 35116 [2024-11-22 00:53:24,420 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 35172 treesize of output 35160 [2024-11-22 00:53:25,974 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 35126 treesize of output 35110 [2024-11-22 00:53:27,214 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 35110 treesize of output 35094 [2024-11-22 00:53:28,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:28,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35508 treesize of output 35489 [2024-11-22 00:53:30,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:30,438 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 35550 treesize of output 35527 [2024-11-22 00:53:32,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:32,329 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 35314 treesize of output 35291 [2024-11-22 00:53:33,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:33,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35282 treesize of output 35259 [2024-11-22 00:53:35,071 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 35468 treesize of output 35448 [2024-11-22 00:53:36,649 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 35278 treesize of output 35262 [2024-11-22 00:53:38,224 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 35352 treesize of output 35340 [2024-11-22 00:53:39,861 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 35306 treesize of output 35290 [2024-11-22 00:53:41,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:41,199 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 35524 treesize of output 35507 [2024-11-22 00:53:42,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:53:42,835 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 35328 treesize of output 35313 [2024-11-22 00:53:44,105 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 35304 treesize of output 35298 [2024-11-22 00:53:45,551 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 35298 treesize of output 35290