./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-?-c7c6ca5-m [2024-11-08 13:56:50,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:56:50,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:56:50,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:56:50,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:56:50,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:56:50,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:56:50,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:56:50,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:56:50,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:56:50,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:56:50,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:56:50,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:56:50,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:56:50,297 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:56:50,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:56:50,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:56:50,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:56:50,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:56:50,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:56:50,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:56:50,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:56:50,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:56:50,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:56:50,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:56:50,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:56:50,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:56:50,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:56:50,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:56:50,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:56:50,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:56:50,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:56:50,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:56:50,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:56:50,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:56:50,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:56:50,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:56:50,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:56:50,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:56:50,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:56:50,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:56:50,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:56:50,305 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-08 13:56:50,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:56:50,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:56:50,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:56:50,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:56:50,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:56:50,517 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-08 13:56:51,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:56:51,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:56:51,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-08 13:56:51,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed110a8f/e0bfebabaa004b098704ad24670b1009/FLAGf79d1b011 [2024-11-08 13:56:51,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed110a8f/e0bfebabaa004b098704ad24670b1009 [2024-11-08 13:56:51,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:56:51,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:56:51,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:56:51,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:56:51,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:56:51,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:56:51" (1/1) ... [2024-11-08 13:56:51,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd2e523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:51, skipping insertion in model container [2024-11-08 13:56:51,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:56:51" (1/1) ... [2024-11-08 13:56:51,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:56:52,234 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-08 13:56:52,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:56:52,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:56:52,319 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-08 13:56:52,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:56:52,341 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:56:52,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52 WrapperNode [2024-11-08 13:56:52,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:56:52,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:56:52,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:56:52,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:56:52,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,379 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 187 [2024-11-08 13:56:52,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:56:52,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:56:52,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:56:52,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:56:52,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,411 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-08 13:56:52,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:56:52,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:56:52,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:56:52,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:56:52,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (1/1) ... [2024-11-08 13:56:52,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:56:52,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:52,452 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-08 13:56:52,454 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-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:56:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:56:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:56:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:56:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:56:52,587 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:56:52,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:56:52,786 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-08 13:56:52,786 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:56:52,794 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:56:52,795 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-08 13:56:52,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:56:52 BoogieIcfgContainer [2024-11-08 13:56:52,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:56:52,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:56:52,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:56:52,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:56:52,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:56:51" (1/3) ... [2024-11-08 13:56:52,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6595b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:56:52, skipping insertion in model container [2024-11-08 13:56:52,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:56:52" (2/3) ... [2024-11-08 13:56:52,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6595b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:56:52, skipping insertion in model container [2024-11-08 13:56:52,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:56:52" (3/3) ... [2024-11-08 13:56:52,802 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-08 13:56:52,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:56:52,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:56:52,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:56:52,861 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;@54bbc895, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:56:52,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:56:52,865 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-08 13:56:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:56:52,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:52,872 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-08 13:56:52,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2024-11-08 13:56:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772252117] [2024-11-08 13:56:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:56:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,162 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-08 13:56:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772252117] [2024-11-08 13:56:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772252117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:56:53,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024908258] [2024-11-08 13:56:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:53,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:56:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:56:53,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:56:53,192 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 3 states, 3 states have (on average 5.666666666666667) 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-08 13:56:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:53,256 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2024-11-08 13:56:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:56:53,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) 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-08 13:56:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:53,263 INFO L225 Difference]: With dead ends: 79 [2024-11-08 13:56:53,263 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:56:53,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:56:53,269 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:53,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:56:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:56:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 13:56:53,292 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-08 13:56:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-08 13:56:53,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2024-11-08 13:56:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-08 13:56:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) 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-08 13:56:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-08 13:56:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:56:53,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:53,296 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-08 13:56:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:56:53,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:53,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2024-11-08 13:56:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874922675] [2024-11-08 13:56:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:56:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,520 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-08 13:56:53,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874922675] [2024-11-08 13:56:53,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874922675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:53,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:53,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:56:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760207257] [2024-11-08 13:56:53,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:53,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:56:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:56:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:53,525 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) 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-08 13:56:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:53,582 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2024-11-08 13:56:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:56:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) 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-08 13:56:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:53,584 INFO L225 Difference]: With dead ends: 68 [2024-11-08 13:56:53,585 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 13:56:53,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:53,586 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:53,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:56:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 13:56:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-11-08 13:56:53,593 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-08 13:56:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-08 13:56:53,595 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2024-11-08 13:56:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:53,595 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-08 13:56:53,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) 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-08 13:56:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-08 13:56:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:56:53,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:53,597 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-08 13:56:53,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:56:53,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:53,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2024-11-08 13:56:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:53,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760139137] [2024-11-08 13:56:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:56:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:56:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:53,730 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-08 13:56:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760139137] [2024-11-08 13:56:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760139137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:56:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:56:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:56:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871215969] [2024-11-08 13:56:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:56:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:56:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:56:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:53,735 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) 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-08 13:56:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:53,793 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-08 13:56:53,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:56:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) 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-08 13:56:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:53,794 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:56:53,794 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:56:53,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:56:53,795 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:53,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:56:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:56:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:56:53,800 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-08 13:56:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-08 13:56:53,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2024-11-08 13:56:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:53,803 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-08 13:56:53,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) 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-08 13:56:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-08 13:56:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:56:53,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:53,805 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-08 13:56:53,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:56:53,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:53,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2024-11-08 13:56:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:53,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266972330] [2024-11-08 13:56:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:56:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:56:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:56:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:56:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:56:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266972330] [2024-11-08 13:56:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266972330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648951812] [2024-11-08 13:56:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:55,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:56:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:56:55,768 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-08 13:56:55,769 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-08 13:56:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:56:56,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-11-08 13:56:56,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:56:56,255 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-08 13:56:56,487 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-08 13:56:56,563 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:56:56,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:56:56,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:56:56,644 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-08 13:56:56,719 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:56:56,719 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 57 treesize of output 50 [2024-11-08 13:56:56,727 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 24 treesize of output 11 [2024-11-08 13:56:56,893 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-08 13:56:56,894 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 107 treesize of output 115 [2024-11-08 13:56:56,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:56:56,907 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 28 treesize of output 25 [2024-11-08 13:56:56,914 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-08 13:56:56,922 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-08 13:56:56,928 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2024-11-08 13:56:57,067 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 30 treesize of output 14 [2024-11-08 13:56:57,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:56:57,075 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-08 13:56:57,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:56:57,316 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 38 treesize of output 27 [2024-11-08 13:56:57,329 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:56:57,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:56:57,342 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-08 13:56:57,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-08 13:56:57,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2024-11-08 13:56:57,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-08 13:56:57,702 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-08 13:56:57,772 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-08 13:56:57,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:56:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648951812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:56:58,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:56:58,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2024-11-08 13:56:58,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763858801] [2024-11-08 13:56:58,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:56:58,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 13:56:58,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:56:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 13:56:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2537, Unknown=44, NotChecked=0, Total=2756 [2024-11-08 13:56:58,254 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-08 13:56:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:56:59,699 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2024-11-08 13:56:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 13:56:59,701 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-08 13:56:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:56:59,702 INFO L225 Difference]: With dead ends: 83 [2024-11-08 13:56:59,702 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 13:56:59,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=323, Invalid=4460, Unknown=47, NotChecked=0, Total=4830 [2024-11-08 13:56:59,704 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 13:56:59,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 461 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 13:56:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 13:56:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2024-11-08 13:56:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:56:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-08 13:56:59,730 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 36 [2024-11-08 13:56:59,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:56:59,731 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-08 13:56:59,732 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-08 13:56:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-08 13:56:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:56:59,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:56:59,736 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-08 13:56:59,752 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-08 13:56:59,936 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-08 13:56:59,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:56:59,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:56:59,937 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2024-11-08 13:56:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:56:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128036190] [2024-11-08 13:56:59,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:56:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:56:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,077 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-08 13:57:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128036190] [2024-11-08 13:57:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128036190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:57:00,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140625070] [2024-11-08 13:57:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:57:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:00,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:57:00,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:57:00,079 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.6) 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-08 13:57:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:00,122 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-08 13:57:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:57:00,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) 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-08 13:57:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:00,123 INFO L225 Difference]: With dead ends: 77 [2024-11-08 13:57:00,123 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 13:57:00,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:57:00,124 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:00,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 115 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 13:57:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-08 13:57:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:57:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2024-11-08 13:57:00,131 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 37 [2024-11-08 13:57:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:00,132 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2024-11-08 13:57:00,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) 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-08 13:57:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2024-11-08 13:57:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:57:00,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:00,134 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-08 13:57:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:57:00,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2024-11-08 13:57:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480185091] [2024-11-08 13:57:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,299 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-08 13:57:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480185091] [2024-11-08 13:57:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480185091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678498527] [2024-11-08 13:57:00,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:57:00,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:00,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:00,303 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-08 13:57:00,304 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-08 13:57:00,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:57:00,489 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:57:00,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 13:57:00,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:00,514 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-08 13:57:00,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:57:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678498527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:57:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-08 13:57:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705893258] [2024-11-08 13:57:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:00,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:57:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:57:00,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:57:00,518 INFO L87 Difference]: Start difference. First operand 58 states and 74 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-08 13:57:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:00,543 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-08 13:57:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:57:00,544 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-08 13:57:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:00,544 INFO L225 Difference]: With dead ends: 78 [2024-11-08 13:57:00,544 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 13:57:00,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:57:00,545 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:00,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 133 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 13:57:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-08 13:57:00,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:57:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-08 13:57:00,557 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 37 [2024-11-08 13:57:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:00,558 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-08 13:57:00,558 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-08 13:57:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-08 13:57:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:57:00,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:00,558 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-08 13:57:00,572 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-08 13:57:00,759 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-08 13:57:00,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:00,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:00,760 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2024-11-08 13:57:00,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:00,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685688219] [2024-11-08 13:57:00,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:00,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:00,888 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-08 13:57:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685688219] [2024-11-08 13:57:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685688219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160528186] [2024-11-08 13:57:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:00,890 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-08 13:57:00,892 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-08 13:57:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:01,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 13:57:01,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:01,059 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-08 13:57:01,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:01,126 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-08 13:57:01,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160528186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:57:01,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:57:01,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-08 13:57:01,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051570046] [2024-11-08 13:57:01,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:01,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 13:57:01,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 13:57:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:57:01,127 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:57:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:01,211 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-11-08 13:57:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:57:01,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-08 13:57:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:01,212 INFO L225 Difference]: With dead ends: 73 [2024-11-08 13:57:01,212 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 13:57:01,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:57:01,213 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:01,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:57:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 13:57:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 13:57:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:57:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-11-08 13:57:01,218 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2024-11-08 13:57:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:01,218 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-11-08 13:57:01,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:57:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-11-08 13:57:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:57:01,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:01,219 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-08 13:57:01,235 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-08 13:57:01,420 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-08 13:57:01,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:01,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2024-11-08 13:57:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707925421] [2024-11-08 13:57:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:01,684 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-08 13:57:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707925421] [2024-11-08 13:57:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707925421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145992485] [2024-11-08 13:57:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:01,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:01,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:01,687 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-08 13:57:01,687 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-08 13:57:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:01,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 13:57:01,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:01,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 13:57:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:57:01,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:01,985 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-08 13:57:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145992485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:57:01,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:57:01,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 16 [2024-11-08 13:57:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867098162] [2024-11-08 13:57:01,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:01,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 13:57:01,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 13:57:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:57:01,986 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:57:06,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:10,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:14,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:18,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:22,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:26,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:30,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:57:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:30,255 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2024-11-08 13:57:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 13:57:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-08 13:57:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:30,256 INFO L225 Difference]: With dead ends: 94 [2024-11-08 13:57:30,256 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 13:57:30,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-08 13:57:30,257 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:30,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 367 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-11-08 13:57:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 13:57:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 13:57:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:57:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-11-08 13:57:30,266 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 38 [2024-11-08 13:57:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:30,266 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-11-08 13:57:30,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:57:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-11-08 13:57:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 13:57:30,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:30,267 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-08 13:57:30,282 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-08 13:57:30,468 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-08 13:57:30,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2024-11-08 13:57:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580577944] [2024-11-08 13:57:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:30,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:57:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:57:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:31,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 13:57:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:57:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580577944] [2024-11-08 13:57:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580577944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709391893] [2024-11-08 13:57:32,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:32,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:32,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:32,043 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-08 13:57:32,044 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-08 13:57:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:32,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-08 13:57:32,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:32,497 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-08 13:57:32,702 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from false [2024-11-08 13:57:32,705 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))) is different from true [2024-11-08 13:57:32,717 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-08 13:57:32,732 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-08 13:57:32,743 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) is different from false [2024-11-08 13:57:32,745 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) is different from true [2024-11-08 13:57:32,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:57:32,765 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 49 treesize of output 44 [2024-11-08 13:57:32,785 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-08 13:57:32,785 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-08 13:57:32,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from false [2024-11-08 13:57:32,798 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1))) is different from true [2024-11-08 13:57:32,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2024-11-08 13:57:32,828 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from true [2024-11-08 13:57:32,880 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-08 13:57:32,881 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 140 treesize of output 144 [2024-11-08 13:57:32,888 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 144 treesize of output 124 [2024-11-08 13:57:32,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:32,900 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 71 treesize of output 34 [2024-11-08 13:57:32,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:32,913 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2024-11-08 13:57:32,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) (select .cse2 4)) 0))) is different from false [2024-11-08 13:57:32,944 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) (.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select .cse2 0) 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) (select .cse2 4)) 0))) is different from true [2024-11-08 13:57:32,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) (select .cse3 4))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select .cse3 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-08 13:57:32,976 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (.cse3 (select |c_#memory_$Pointer$#2.offset| .cse0))) (and (= (select |c_#valid| .cse0) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse2) (select .cse3 4))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= 0 (select .cse3 0)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-08 13:57:33,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-08 13:57:33,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,007 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2024-11-08 13:57:33,024 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:57:33,027 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:57:33,054 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:57:33,056 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:57:33,086 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-08 13:57:33,105 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from false [2024-11-08 13:57:33,106 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 8) |c_node_create_#in~data#1|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|)) is different from true [2024-11-08 13:57:33,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,151 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 45 treesize of output 34 [2024-11-08 13:57:33,173 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-08 13:57:33,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 75 [2024-11-08 13:57:33,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:57:33,204 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 13:57:33,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 31 [2024-11-08 13:57:33,220 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 23 treesize of output 19 [2024-11-08 13:57:33,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse7 (= 0 (select .cse6 0))) (.cse8 (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (and (= 0 (select .cse5 (select .cse6 4))) .cse7) (and (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (or .cse8 .cse7)) (and .cse8 (or (exists ((v_arrayElimCell_45 Int)) (= (select .cse5 v_arrayElimCell_45) 0)) (and (= (select .cse5 0) 0) (= (select .cse5 (select .cse5 4)) 0)))))))))) is different from false [2024-11-08 13:57:33,274 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse3 (select |v_old(#valid)_AFTER_CALL_15| .cse3))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_16| .cse4)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (let ((.cse6 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse7 (= 0 (select .cse6 0))) (.cse8 (= .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.offset| .cse4))) (or (and (= 0 (select .cse5 (select .cse6 4))) .cse7) (and (= .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (or .cse8 .cse7)) (and .cse8 (or (exists ((v_arrayElimCell_45 Int)) (= (select .cse5 v_arrayElimCell_45) 0)) (and (= (select .cse5 0) 0) (= (select .cse5 (select .cse5 4)) 0)))))))))) is different from true [2024-11-08 13:57:33,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse7))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse6)) (.cse5 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse7)) (.cse4 (= 0 (select .cse3 0)))) (or (and (= 0 (select .cse2 (select .cse3 4))) .cse4) (and .cse5 (or (exists ((v_arrayElimCell_45 Int)) (= (select .cse2 v_arrayElimCell_45) 0)) (and (= (select .cse2 0) 0) (= (select .cse2 (select .cse2 4)) 0)))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6) (or .cse5 .cse4))))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) is different from false [2024-11-08 13:57:33,358 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| .cse7) 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse7))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse6)) (.cse5 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse7)) (.cse4 (= 0 (select .cse3 0)))) (or (and (= 0 (select .cse2 (select .cse3 4))) .cse4) (and .cse5 (or (exists ((v_arrayElimCell_45 Int)) (= (select .cse2 v_arrayElimCell_45) 0)) (and (= (select .cse2 0) 0) (= (select .cse2 (select .cse2 4)) 0)))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse6) (or .cse5 .cse4))))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse7) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| .cse6)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) is different from true [2024-11-08 13:57:33,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse7)) (.cse6 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2)) (.cse5 (= 0 (select .cse4 0)))) (or (and (= 0 (select .cse3 (select .cse4 4))) .cse5) (and .cse6 (or (exists ((v_arrayElimCell_45 Int)) (= (select .cse3 v_arrayElimCell_45) 0)) (and (= (select .cse3 0) 0) (= (select .cse3 (select .cse3 4)) 0)))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse7) (or .cse6 .cse5))))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-08 13:57:33,442 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse1) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| .cse2))) (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| .cse7)) (.cse6 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse2)) (.cse5 (= 0 (select .cse4 0)))) (or (and (= 0 (select .cse3 (select .cse4 4))) .cse5) (and .cse6 (or (exists ((v_arrayElimCell_45 Int)) (= (select .cse3 v_arrayElimCell_45) 0)) (and (= (select .cse3 0) 0) (= (select .cse3 (select .cse3 4)) 0)))) (and (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse7) (or .cse6 .cse5))))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= 1 (select |v_old(#valid)_AFTER_CALL_16| .cse7)) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-08 13:57:33,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:57:33,570 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-08 13:57:33,578 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 0 case distinctions, treesize of input 251 treesize of output 142 [2024-11-08 13:57:33,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,603 INFO L349 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2024-11-08 13:57:33,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 271 treesize of output 190 [2024-11-08 13:57:33,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2024-11-08 13:57:33,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,629 INFO L349 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2024-11-08 13:57:33,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 128 [2024-11-08 13:57:33,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:57:33,645 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 104 treesize of output 62 [2024-11-08 13:57:33,660 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 13 treesize of output 3 [2024-11-08 13:57:33,667 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-08 13:57:33,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (exists ((v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from false [2024-11-08 13:57:33,702 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0))) (and (= (select (select |c_#memory_int#2| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4| Int) (v_arrayElimCell_33 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_7|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1))) |v_#valid_BEFORE_CALL_7|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_33) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_4|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_7| .cse2) 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 (select (select |c_#memory_$Pointer$#2.offset| .cse3) 0)) (exists ((v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) is different from true [2024-11-08 13:57:33,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:33,722 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 83 treesize of output 59 [2024-11-08 13:57:33,731 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:57:33,732 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 15 treesize of output 7 [2024-11-08 13:57:33,752 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_46) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse1) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0))) is different from false [2024-11-08 13:57:33,753 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((v_arrayElimCell_46 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_46) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int#2| .cse1) 8)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) 0))) is different from true [2024-11-08 13:57:33,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-08 13:57:33,781 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-08 13:57:33,792 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from false [2024-11-08 13:57:33,794 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_20| Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse0 (select |v_old(#valid)_AFTER_CALL_15| .cse0))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_46) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 1) (= (select |v_old(#valid)_AFTER_CALL_16| |v_ULTIMATE.start_main_~ptr~0#1.base_20|) 0)))) is different from true [2024-11-08 13:57:33,825 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-08 13:57:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2024-11-08 13:57:33,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:33,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 Int) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1750))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1749))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1752) (select (select (store (store (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|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1745) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1743) .cse1) .cse2)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |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.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1741) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1740) .cse1) .cse2)))))) is different from false [2024-11-08 13:57:33,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 Int) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_1750))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_1749))) .cse1 v_ArrVal_1752) (select (select (store (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1745) .cse1 v_ArrVal_1743) .cse3) .cse4)) (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_1741) .cse1 v_ArrVal_1740) .cse3) .cse4) 8)))))) is different from false [2024-11-08 13:57:33,976 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 Int) (v_ArrVal_1745 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1752 (Array Int Int)) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int)) (v_ArrVal_1750 (Array Int Int)) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (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 ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse1)) (.cse4 (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|))) (let ((.cse2 (select .cse3 .cse4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int#2| .cse1 v_ArrVal_1750))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_1749))) .cse2 v_ArrVal_1752) (select (select (store (store (store |c_#memory_$Pointer$#2.base| .cse1 (store .cse3 .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1745) .cse2 v_ArrVal_1743) .cse5) .cse6)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse1 (store (select |c_#memory_$Pointer$#2.offset| .cse1) .cse4 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_1741) .cse2 v_ArrVal_1740) .cse5) .cse6)))))))) is different from false [2024-11-08 13:57:34,075 INFO L349 Elim1Store]: treesize reduction 241, result has 51.2 percent of original size [2024-11-08 13:57:34,075 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 2 case distinctions, treesize of input 26544 treesize of output 24652 [2024-11-08 13:57:34,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:34,099 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 1093 treesize of output 1093 [2024-11-08 13:57:34,115 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 2750 treesize of output 2450 [2024-11-08 13:57:34,132 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 709 treesize of output 469 [2024-11-08 13:57:34,165 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 64 treesize of output 4 [2024-11-08 13:57:35,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:35,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2712 treesize of output 3384 [2024-11-08 13:57:51,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:51,335 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:57:51,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:51,379 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:57:53,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:53,733 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:57:53,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:53,756 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:57:53,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:53,776 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-11-08 13:57:54,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:54,370 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:57:54,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:54,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:57:55,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:55,082 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 281 [2024-11-08 13:57:55,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:55,624 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:57:55,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:55,670 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:57:55,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:55,697 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:57:55,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:55,737 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:57:57,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:57,187 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:57:59,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:57:59,084 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:00,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:00,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 324 [2024-11-08 13:58:01,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:01,557 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 324 [2024-11-08 13:58:01,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:01,832 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:01,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:01,851 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:05,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:05,476 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:05,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:05,524 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:05,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:05,559 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:05,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:05,584 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:06,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:06,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 281 [2024-11-08 13:58:06,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:06,912 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:06,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:06,932 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:07,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:07,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:07,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:07,530 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:07,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:07,560 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:09,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:09,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:10,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:10,575 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 324 [2024-11-08 13:58:10,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:10,784 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:10,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:10,802 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:11,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,877 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:11,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:11,977 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:12,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:12,977 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:12,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:12,997 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-11-08 13:58:13,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:13,639 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 281 [2024-11-08 13:58:13,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:13,751 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:13,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:13,779 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:16,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:16,478 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:16,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:16,512 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:16,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:16,535 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:16,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:16,568 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:21,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:21,587 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:21,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:21,647 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:21,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:21,701 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2024-11-08 13:58:25,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:25,003 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2024-11-08 13:58:25,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:25,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:25,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:25,464 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191 [2024-11-08 13:58:25,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:25,496 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:27,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:27,910 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 324 [2024-11-08 13:58:28,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:28,483 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 144 [2024-11-08 13:58:28,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:28,519 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 234 [2024-11-08 13:58:28,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:28,559 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 191